Item Details

A Platform for Biological Sequence Comparison on Parallel Computers

Deshpande, A; Richards, D
Format
Report
Author
Deshpande, A
Richards, D
Abstract
We have written two programs for searching biological sequence databases that run on Intel hypercube computers. PSCANLIB compares a single sequence against a sequence library, and PCOMPLIB compares all the entries in one sequence library against a second library. The programs provide a general framework for similarity searching; they include functions for reading in query sequences, search pararneters, and library entries, and reporting the results of a search. We have isolated the code for the specific function that calculates the similarity score between the query and library sequence; alternative searching algorithms can be implemented by editing two files. We have implemented the rapid FASTA sequence comparison algorithm and the more rigorous Smith-Waterman algorithm within this framework. The PSCANLIB program on a 16-node iPSC/2 80386-based hypercube can compare a 229 amino acid protein sequence with a 3.4 million residue sequence library in about 16 seconds with the FASTA algorithm. Using the Smith-Waterman algorithm, the same search takes 35 minutes. The PCOMPLIB program can compare a 0.8 million amino acid protein sequence library with itself in 5.3 minutes with FASTA on a third-generation 32»node Intel iPSC/860 hypercube. Note: Abstract extracted from PDF file via OCR
Language
English
Date Received
20121029
Published
University of Virginia, Department of Computer Science, 1990
Published Date
1990
Collection
Libra Open Repository
Logo for In CopyrightIn Copyright

Availability

Access Online