Issue No. 04 - October-December (2004 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2004.43
<p><b>Abstract</b>—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. </p>
Segmentation, change point estimation, noncoding RNA, thermophiles.
Mikl? Csur?, "Maximum-Scoring Segment Sets", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 1, no. , pp. 139-150, October-December 2004, doi:10.1109/TCBB.2004.43