Parallel algorithms for analyzing DNA and protein sequences are becoming increasingly important as sequence data continues to grow. This paper examines the parallel characteristics of four sequence alignment algorithms. The four algorithms presented are the dynamic programming algorithm developed by Needleman, Wunsch, and Sellers (the NWS algorithm), Fickett's algorithm, a parallel algorithm using some of Fickett's ideas, and an algorithm which uses some of Wilbur and Lipman's ideas for constructing alignments which are not always optimal. The NWS algorithm contains the most parallelism but also does more work than any of the other algorithms which we studied. Fickett's algorithm contains the least parallelism. However, a parallel algorithm which requires significantly fewer instructions than the NWS algorithm is obtained by modifying Fickett's algorithm. The algorithms have been implemented for a dataflow computer in the dataflow language Id.
[1]
J. Kruskal.
An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
,
1983
.
[2]
S. B. Needleman,et al.
A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins
,
1989
.
[3]
Robert A. Wagner,et al.
Parallelization of the Dynamic Programming Algorithm for Comparison of Sequences
,
1987,
International Conference on Parallel Processing.
[4]
James W. Fickett,et al.
Fast optimal alignment
,
1984,
Nucleic Acids Res..
[5]
D. Lipman,et al.
Rapid similarity searches of nucleic acid and protein data banks.
,
1983,
Proceedings of the National Academy of Sciences of the United States of America.
[6]
P. Sellers.
On the Theory and Computation of Evolutionary Distances
,
1974
.