.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
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.
Keyword:
segmentation
change point estimation
noncoding RNA
thermophiles
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
暂无机构信息
引用论文
A TUTORIAL ON HIDDEN MARKOV-MODELS AND SELECTED APPLICATIONS IN SPEECH RECOGNITION关于语音识别中的隐马尔可夫模型和选定应用的教程.png)
PROCEEDINGS OF THE IEEE.png)
PROCEEDINGS OF THE IEEEIF25.9
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏Characterization of polymer matrix and low melting point solder for anisotropic conductive film各向异性导电膜用聚合物基体及低熔点焊料的表征
PREAI
分享收藏
查看更多内容