title: Poly(A) motif prediction using spectral latent features from human DNA sequences.
abstract: BACKGROUND
  Polyadenylation is the addition of a poly(A) tail to an RNA molecule. Identifying DNA sequence motifs that signal the addition of poly(A) tails is essential to improved genome annotation and better understanding of the regulatory mechanisms and stability of mRNA. Existing poly(A) motif predictors demonstrate that information extracted from the surrounding nucleotide sequences of candidate poly(A) motifs can differentiate true motifs from the false ones to a great extent. A variety of sophisticated features has been explored, including sequential, structural, statistical, thermodynamic and evolutionary properties. However, most of these methods involve extensive manual feature engineering, which can be time-consuming and can require in-depth domain knowledge.
  
  
  RESULTS
  We propose a novel machine-learning method for poly(A) motif prediction by marrying generative learning (hidden Markov models) and discriminative learning (support vector machines). Generative learning provides a rich palette on which the uncertainty and diversity of sequence information can be handled, while discriminative learning allows the performance of the classification task to be directly optimized. Here, we used hidden Markov models for fitting the DNA sequence dynamics, and developed an efficient spectral algorithm for extracting latent variable information from these models. These spectral latent features were then fed into support vector machines to fine-tune the classification performance. We evaluated our proposed method on a comprehensive human poly(A) dataset that consists of 14 740 samples from 12 of the most abundant variants of human poly(A) motifs. Compared with one of the previous state-of-the-art methods in the literature (the random forest model with expert-crafted features), our method reduces the average error rate, false-negative rate and false-positive rate by 26, 15 and 35%, respectively. Meanwhile, our method makes ~30% fewer error predictions relative to the other string kernels. Furthermore, our method can be used to visualize the importance of oligomers and positions in predicting poly(A) motifs, from which we can observe a number of characteristics in the surrounding regions of true and false motifs that have not been reported before.
  
  
  BACKGROUND
  http://sfb.kaust.edu.sa/Pages/Software.aspx.
  
  
  BACKGROUND
  Supplementary data are available at Bioinformatics online.
authors.affiliation: College of Computing, Georgia Institute of Technology, Atlanta, GA 30332, USA.
authors.forename: Bo
authors.initials: B
authors.lastname: Xie
authors.forename: Boris R
authors.initials: BR
authors.lastname: Jankovic
authors.forename: Vladimir B
authors.initials: VB
authors.lastname: Bajic
authors.forename: Le
authors.initials: L
authors.lastname: Song
authors.forename: Xin
authors.initials: X
authors.lastname: Gao
mesh_terms: D020413:3' Untranslated Regions; D000465:Algorithms; D001185:Artificial Intelligence; D004247:DNA / Q000737:chemistry*; D006801:Humans; D008390:Markov Chains; D059372:Nucleotide Motifs; D011061:Poly A / Q000235:genetics*; D026723:Polyadenylation; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software; D060388:Support Vector Machine
chemical_list: D020413:3' Untranslated Regions; D011061:Poly A; D004247:DNA