|
|||||
|
|
| 基于最小生成树的多序列联配算法 | |
| 引用本文： | 胡桂武,郑启伦,彭宏,邓伟林.基于最小生成树的多序列联配算法[J].计算机科学,2005,32(4):59-61. |
| 作者姓名： | 胡桂武 郑启伦 彭宏 邓伟林 |
| 作者单位： | 1. 华南理工大学计算机科学与工程学院,广州,510640;广东商学院数学系,广州,51020 2. 华南理工大学计算机科学与工程学院,广州,510640 3. 广东职业技术学院计算机系,广州,510300 |
| 基金项目： | 国家自然科学基金(编号:30230350) |
| 摘 要： | 多序列联配(MAS)是现代生物信息学中的重要工具之一,MAS问题是NP-难的,因此需要一些启发式方法在合理的时间内联配大的数据集。本文提出了一个基于最小生成树的多序列联配算法,并使用BALiBASE标准数据集合,对我们的算法进行了性能评价,结果表明算法较之ClustalX类的算法其精确度更高。 |
| 关 键 词： | 多序列联配 最小生成树 联配算法 分子生物学 |
Multiple Sequence Alignment Based Minimum Spanning Tree |
|
| HU Gui-Wu,ZHENG Qi-Lun,PENG Hong,DENG Wei-Lin.Multiple Sequence Alignment Based Minimum Spanning Tree[J].Computer Science,2005,32(4):59-61. | |
| Authors: | HU Gui-Wu ZHENG Qi-Lun PENG Hong DENG Wei-Lin |
| Affiliation: | HU Gui-Wu,ZHENG Qi-Lun,PENG Hong,DENG Wei-Lin College of Computer Science and Engineering,South China University of Technology,Guangzhou 510640 Department of Mathematics,Guangdong Business College,Guangzhou 510320 Department of Computing,Guangdong Industry Technical College,Guangzhou 510300 |
| Abstract: | Multiple Sequence Alignment (MSA) is one of the most important tools in modern biology. The MSA problem is NP-hard; therefore, heuristic approaches are needed to align a large set of data within a reasonable time. In this paper, a new MSA algorithm is proposed. We use a Minimum Spanning Tree (MST) algorithm to construct a guide tree in which the sequences are aligned. Quality assessment of our algorithm with ClustalX was conducted using the BAliBASE benchmarks. It is found that our algorithm can provide alignments which are better than those from ClustalX in most test cases. |
| Keywords: | Multiple sequence alignment Minimum spanning tree Algorithm Molecular biology |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机科学》下载全文 | |
