.png){kind=icon}
Return
Maximum-scoring segment sets
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2004.43.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
segmentation
change point estimation
noncoding RNA
thermophiles
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
Organization
No organization information available
Cited Papers
ShareSaveA TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
ShareSaveCharacterization of polymer matrix and low melting point solder for anisotropic conductive film
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more