A parallel wavefront algorithm for efficient biological sequence comparison

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2668, Issue , 2003, Pages 249-258

  Alves, C E R ^a   Caceres E N ^b   Dehne, F ^c   Song, S W ^d  

^a SÃO JUDAS TADEU UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF MATO GROSSO DO SUL   (Brazil)

^c CARLETON UNIVERSITY   (Canada)

^d UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; GRID COMPUTING; PARALLEL PROCESSING SYSTEMS; PARAMETER ESTIMATION; WAVEFRONTS;

BEOWULF; BIOLOGICAL SEQUENCES; COMMUNICATION ROUNDS; COMPUTING TIME; DISTRIBUTED-MEMORY PARALLEL COMPUTERS; WAVEFRONT ALGORITHMS;

ALGORITHMS;

EID: 35248829118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44843-8_27     Document Type: Review

References (16)

1. C. E. R. Alves, E. N. Cceres, F. Dehne, and S. W. Song. Parallel dynamic programming for solving the string editing problem on a CGM/BSP. In Proceedings of the 14th Symposium on Parallel Algorithms and Architectures (ACM-SPAA), pages 275-281. ACM Press, 2002.
2. C. E. R. Alves, E. N. Cceres, F. Dehne, and S. W. Song. A CGM/BSP parallel similarity algorithm. In Proceedings of the I Brazilian Workshop on Bioinformatics, pages 1-8, October 2002.
3. A. Apostolico, L. L. Larmore M. J. Atallah, and S. Macfaddin. Efficient parallel algorithms for string editing and related problems. SIAM J. Comput., 19(5):968-988, 1990.
4. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. In Proc. ACM 9th Annual Computational Geometry, pages 298-307, 1993.
5. F. Dehne (Editor). Coarse grained parallel algorithms. Special Issue of Algorithmica, 24(3/4):173-176, 1999.
6. Z. Galil and K. Park. Parallel dynamic programming. Technical Report CUCS-040-91, Columbia University-Computer Science Dept., 1991.
7. Z. Galil and K. Park. Dynamic programming with convexity, concavity and sparsity. Theoretical Computer Science, pages 49-76, 1992.
8. M. Gengler. An introduction to parallel dynamic programming. Lecture Notes in Computre Science, 1054:87-114, 1996.
9. P. A. Hall and G. R. Dowling. Approximate string matching. Comput. Surveys, (12):381-402, 1980.
10. J. W. Hunt and T. Szymansky. An algorithm for differential file comparison. Comm. ACM, (20):350-353, 1977.
11. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Bio., (48):443-453, 1970.
12. P. H. Sellers. The theory and computation of evolutionary distances: Pattern recognition. J. Algorithms, (1):359-373, 1980.
13. J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.
14. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. J. Mol. Bio., (147):195-197, 1981.
15. L. Valiant. A bridging model for parallel computation. Communication of the ACM, 33(8):103-111, 1990.
16. S. Wu and U. Manber. Fast text searching allowing errors. Comm. ACM, (35):83-91, 1992.