Whole Genome Comparison on a Network of Workstations

Whole genome comparison consists of comparing or aligning genome sequences with a goal of finding similarities between them. Previously we have shown how SIMD extensions used in Intel processors can be used to efficiently implement the, genome comparing, Smith-Waterman algorithm. Here we present distributed version of that algorithm. We show that on somewhat outdated hardware we can achieve speeds upwards of 8000 MCUPS; one of the fastest implementations of the Smith-Waterman algorithm.

[1]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[2]  Ruby B. Lee.  Multimedia extensions for general-purpose processors , 1997, 1997 IEEE Workshop on Signal Processing Systems. SiPS 97 Design and Implementation formerly VLSI Signal Processing.

[3]  P. Sellers.  On the Theory and Computation of Evolutionary Distances , 1974 .

[4]  Uri C. Weiser,et al.  Intel MMX for multimedia PCs , 1997, Commun. ACM.

[5]  Eric Rice,et al.  The UCSC Kestrel parallel processor , 2005, IEEE Transactions on Parallel and Distributed Systems.

[6]  Guang R. Gao,et al.  A Multithreaded Parallel Implementation of a Dynamic Programming Algorithm for Sequence Comparison , 2000, Pacific Symposium on Biocomputing.

[7]  Volker Strumpen.  Parallel Molecular Sequence Analysis on Workstations in the Internet , 1993 .

[8]  Christus,et al.  A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .

[9]  Alfred V. Aho,et al.  Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[10]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[11]  Ophir Frieder,et al.  Parallel computation in biological sequence analysis , 1998 .

[12]  Sugata Sanyal,et al.  Applying SIMD Approach to Whole Genome Comparison on Commodity Hardware , 2007, PPAM.

[13]  O. Gotoh.  An improved algorithm for matching biological sequences. , 1982, Journal of molecular biology.

[14]  Richard Hughey,et al.  Parallel hardware for sequence comparison and alignment , 1996, Comput. Appl. Biosci..

[15]  Eugene W. Myers,et al.  Optimal alignments in linear space , 1988, Comput. Appl. Biosci..