A parallel Smith-Waterman algorithm based on divide and conquer

  title={A parallel Smith-Waterman algorithm based on divide and conquer},
  author={Fa Zhang and Xiang-Zhen Qiao and Zhi-Yong Liu},
  journal={Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings.},
Biological sequence comparison is an important tool for researchers in molecular biology. There are several algorithms for sequence comparison. The Smith-Waterman algorithm, based on dynamic programming, is one of the most fundamental algorithms in bioinformatics. However, the existing parallel Smith-Waterman algorithm needs large memory space. As the data of biological sequences expand rapidly, the memory requirement of the existing parallel Smith-Waterman algorithm has becoming a critical… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 35 extracted citations


Publications referenced by this paper.
Showing 1-10 of 12 references

Parallel computation for Dynamic Programming. 2nd Int. ICSC symposium on computational Intelligence methods & applications (CIMA2001)

  • Xiangzhen Qiao, Zhao Li, Mingfa Zhu
  • Bangor, Wales, UK,
  • 2001
2 Excerpts

Biological Sequence Analysis, Technical Report, Department of Computer Science and Engineering

  • Martin Tompa
  • University of Washington,
  • 2000
1 Excerpt

Futamura and K . Mehrotra . Parallel Biological Sequence Comparison using Prefix Computations

  • N. Aluru
  • Proceedings of the 13 th International Parallel…
  • 1998

Parallel similarity Search and Alignment with the Dynamic Programming Method

  • Adam R. Galper, Douglas L. Brutlag
  • Technical Report,
  • 1990
2 Excerpts

Protein sequence comparison on a data parallel computer

  • Eric lander
  • Proceedings of the 1988 International Conference…
  • 1988
2 Excerpts

Similar Papers

Loading similar papers…