Issue No. 03 - March (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.674320
<p><b>Abstract</b>—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These databases, which also contain biological and bibliographical information, are growing at an exponential rate. Consequently, the computational demands needed to explore and analyze the data contained in these databases is quickly becoming a great concern. To meet these demands, we must use high performance computing systems, such as parallel computers and distributed networks of workstations. We present two parallel computational methods for analyzing these biological sequences. The first method is used to retrieve sequences that are homologous to a query sequence. The biological information associated with the homologous sequences found in the database may provide important clues to the structure and function of the query sequence. The second method, which helps in the prediction of the function, structure, and evolutionary history of biological sequences, is used to align a number of homologous sequences with each other. These two parallel computational methods were implemented and evaluated on an Intel iPSC/860 parallel computer. The resulting performance demonstrates that parallel computational methods can significantly reduce the computational time needed to analyze the sequences contained in large databases.</p>
Sequence, comparison, alignment, search, retrieval, database, algorithm, parallel, speculative, computation.
Robert L. Martino, Ophir Frieder, Tieng K. Yap, "Parallel Computation in Biological Sequence Analysis", IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 283-294, March 1998, doi:10.1109/71.674320