首页 | 本学科首页   官方微博 | 高级检索  
     


Parallel processing of biological sequence comparison algorithms
Authors:Elizabeth W. Edmiston  Nolan G. Core  Joel H. Saltz  Roger M. Smith
Affiliation:(1) Duke University Department of Computer Science, USA;(2) Yale University School of Medicine, USA;(3) Yale University Department of Computer Science, USA;(4) Yale University Department of Computer Science, USA
Abstract:Comparison of biological (DNA or protein) sequences provides insight into molecular structure, function, and homology, and is increasingly important as the available databases become larger and more numerous. One method of increasing the speed of the calculations is to perform them in parallel. We present the results of initial investigations using the Intel iPSC/1 hypercube and the Connection Machine (CM-I) for these comparisons. Since these machines have very different architectures, the issues and performance trade-offs discussed have a wide applicability for the parallel processing of biological sequence comparisons. This research was supported in part by the Office of Naval Research under contact No. N00014-86-K-0310 and by NIH Grant T15 LM07056 from the National Library of Medicine.
Keywords:Parallel computation  string matching  biological sequences
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号