Maximum-scoring segment sets.
We examine the problem of finding maximum-scoring sets of disjoint segments in a sequence of scores. The problem arises in DNA and protein segmentation and in postprocessing of sequence alignments. Our key result states a simple recursive relationship between maximum-scoring segment sets. The statement leads to fast algorithms for finding such segment sets. We apply our methods to the identification of noncoding RNA genes in thermophiles.
Csurös
Miklós
M
Départment d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succ. Centre-Ville, Montréal, Qué. H3C 3J7, Canada. csuros@iro.umontreal.ca
D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D004247:DNA / Q000737:chemistry*; D003627:Data Interpretation, Statistical; D006801:Humans; D016013:Likelihood Functions; D017017:Methanococcus / Q000235:genetics; D015233:Models, Statistical; D008962:Models, Theoretical; D011336:Probability; D016415:Sequence Alignment; D016944:Sulfolobus / Q000235:genetics
D004247:DNA