Exact pairwise alignment of megabase genome biological sequences using a Novel Z-align parallel strategy

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Boukerche, Azzedine ^a   Batista, Rodolfo Bezerra ^b   De Melo, Alba Cristina Magalhaes Alves ^a,b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF BRASILIA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BASE PAIRS; BASIC OPERATION; BIOLOGICAL SEQUENCES; EXACT METHODS; EXACT RESULTS; MEGABASE; MEMORY SPACE; PAIRWISE ALIGNMENT; PAIRWISE SEQUENCE ALIGNMENT; PARALLEL STRATEGIES; PROCESSOR CLUSTER; QUADRATIC TIME;

ALIGNMENT; BIOINFORMATICS; DISTRIBUTED PARAMETER NETWORKS; PARALLEL ARCHITECTURES; RADIO TELESCOPES;

HEURISTIC METHODS;

EID: 70449792761     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161113     Document Type: Conference Paper

References (19)

1. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. "Basic local alignment search tool" . Journal of Molecular Biology, 215(3):403-410,1990.
2. R. B Batista, A. Boukerche, A. C. M. A. Melo, "A parallel strategy for biological sequence alignment in restricted memory space". Journal of Parallel and Distributed Computing, v. 68, p. 548-561, 2008.
3. th Int. Workshop on Experimental Algorithms, LNCS 3503, p. 464-475, 2005.
4. C. Chen and B. Schmidt. "Computing large-scale alignments on a multi-cluster". In IEEE International Conference on Cluster Computing, 2003.
5. A. Driga, et al. "Fastlsa: a fast, linear-space, parallel and sequential algorithm for sequence alignment". In Int. Conf. Parallel Processing , pages 48-56, 2003.
6. J. W. Fickett. "Fast optimal alignments". Nucleic Acids Research, 12(1):175-179, 1984.
7. O. Gotoh. "An improved algorithm for matching biological sequences". Journal of Molecular Biology, 162:705-708, 1982.
8. D. Gusfield. "Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology". Cambridge University Press., 1997.
9. D. S. Hirschberg. "A linear space algorithm for computing longest common subsequences" . Commun. Assoc. Comput. Mach., 18(6):341-343, June 1975.
10. th Int. Symposium on Parallel and Distributed Computing (ISPDC), 2007.
11. C. Janaki, R. R. Joshi, "Accelerating Comparative Genomics using Parallel Computing", In Silico Biology, v. 3, n. 4, p. 429-440, 2003.
12. E. W. Myers and W. Miller."Optimal alignments in linear space". Computer Applications in the Biosciences, 4:11-17, 1988.
13. G. Navarro, "A guided tour to approximate string matching". ACM Computing Surveys, 33(1);31-88, 2001.
14. 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. Biol., 48:443-453, 1970.
15. G. Pfister, "In Search of Clusters: The Coming Battle for Lowly Parallel Computing", Prentice Hall Inc, 1995.
16. S. Rajko and S. Aluru, "Space and Time Optimal Parallel Sequence Alignments", IEEE Transactions on Parallel and Distributed Systems, 15(2):1070-1081, 2004.
17. T. F. Smith and M. S. Waterman. "Identification of Common molecular subsequences", Journal of Mol. Biol. 147(1):195-197, 1981.
18. P. Tang and P. C. Yew. "Processor Self-scheduling for multiple parallel nested loops", In International Conference on Parallel Processing (ICPP), p.528-535, 1986.
19. F. Zhang, X. Qiao, and Z. Liu. "A parallel smith-waterman algorithm based on divide and conquer". In Fifth ICA3PP, 2003.