| 一种新的基于结构信息的双生物序列比对方法 |
| |
| 引用本文： | 司秀华,陈国良.一种新的基于结构信息的双生物序列比对方法[J].小型微型计算机系统,2006,27(1):85-89. |
| |
| 作者姓名： | 司秀华 陈国良 |
| |
| 作者单位： | 中国科学技术大学,计算机科学技术系,国家高性能中心,安徽,合肥,230026 |
| |
| 摘 要： | 用于生物序列比对的经典动态规划算法是用一个固定的替换矩阵来逐点计算生物序列间的代价。这些方法可用来发现具有最大计分值的比对结果，但实际上，则更加倾向于考虑生物序列中所隐含的结构或功能信息．本文用可变长马尔科夫链方法来发现生物序列中所隐含的结构或功能信息子片断并定义其权值，最后提出一个新的基于结构信息的生物序列比对方法．
|
| 关 键 词： | 序列比对 概率后缀树 可变长马尔科夫链 |
| 文章编号： | 1000-1220（2006）01-0085-05 |
| 收稿时间： | 2004-09-13 |
| 修稿时间： | 2004-09-13 |
Novel Structure-Based Pairwise Sequence Alignment |
| |
| SI Xiu-hua,CHEN Guo-liang.Novel Structure-Based Pairwise Sequence Alignment[J].Mini-micro Systems,2006,27(1):85-89. |
| |
| Authors: | SI Xiu-hua CHEN Guo-liang |
| |
| Affiliation: | Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center(Hefei |
| |
| Abstract: | The classical dynamic programming algorithms for alignments are based on edition costs computed additionally position by position, according to a fixed substitution matrix. These methods find the global alignment with maximal score but in practice, we favor the information of the structure or the function of the sequences considered. In this paper, we present a method consisting in combining the techniques of dynamic programming and Variable Memory Markov, which reveals the structure or the function of the sequences. |
| |
| Keywords: | sequence alignment probabilistic suffix trees(PST) variable memory markov |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
