摘要
针对分布式存储环境,本文提出一种DNA序列拼接的并行算法,分别对序列拼接中OVERLAP、LAYOUT 和CONSENSUS阶段的串行处理过程和并行算法进行了描述,并给出了算法复杂性分析。数值试验结果表明,算法是高 效的。
A novel parallel algorithm for DNA sequence assembly under the distributed memory environment is presented in this paper. The serial processing procedure and parallel algorithm for OVERLAP, LAYOUT and CONSENSUS of the DNA sequence assembly are described respectively. The complexity of the algorithm is analyzed. Experiments show that this algorithm is of high efficiency.
出处
《计算机工程与科学》
CSCD
2005年第2期71-73,77,共4页
Computer Engineering & Science
