摘要
序列比对是分子生物学研究领域的一个重要的工具。在数据量急剧增加的今天,高效的序列比对算法在研究新发现的次序中显DNA得非常重要。通过和法用系统在工作站机群上已完成了分布式序列比对法。也同样在/高性能并行计算机SmithWatermanPVMInter iPSC860上获得了成功。这个分布式算法在和上充当搜索工具。该文论述了此算法的实现和性能指标。Smith-WatermanInternet
Sequence comparison is one of the most important tools in molecular biology research. As the amount of DNA data increases rapidly, efficient sequence comparison algorithms are essential in studying newly discovered sequences. We have implemented a distributed sequece comparison algorithm by Smith and Waterman on a cluster of workstations using the PVM paradigm. This implementation has achieved similar performance to the Intel iPSC/860 Hypercube, a massively parallel computer. The distributed Smith-Waterman algorithm serves as a search tool for two Internet algorithm serves GRAIL and GENQUEST. This paper describes the implementation and the performance of the algorithm.
出处
《计算机工程》
CAS
CSCD
北大核心
2002年第5期89-90,96,共3页
Computer Engineering
