FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment

Proceedings of the International Conference on Parallel Processing

Volumn 2003-January, Issue , 2003, Pages 48-57

  Driga, A ^a   Lu, P ^a   Schaeffer, J ^a   Szafron, D ^a   Charter, K ^a   Parsons, I ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Amino acids; Bioinformatics; Concurrent computing; Costs; DNA; Dynamic programming; Heuristic algorithms; Parallel processing; Proteins; Sequences

Indexed keywords

ALGORITHMS; ALIGNMENT; AMINO ACIDS; COSTS; DNA; DNA SEQUENCES; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; PROTEINS;

ALIGNMENT ALGORITHMS; CONCURRENT COMPUTING; FUNDAMENTAL OPERATIONS; HIRSCHBERG'S ALGORITHM; PAIRWISE SEQUENCE ALIGNMENT; PARALLEL PROCESSING; SEQUENCES; SEQUENTIAL ALGORITHM;

BIOINFORMATICS;

EID: 84944719946     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2003.1240565     Document Type: Conference Paper

References (18)

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:403-410, 1990.
2. S. Aluru, N. Futamura, and K. Mehrotra. Parallel biological sequence comparison using prefix computations. In International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP), pages 467-473, April 1999.
3. R. D. Appel, A. Bairoch, and D. F. Hochstrasser. A new generation of information retrieval tools for biologists: the example of the ExPASy WWW server. Trends in Biochem. Sci., 19:258-260, 1994. http://ca.expasy.org/sprot/.
4. K. Charter, J. Schaeffer, and D. Szafron. Sequence alignment using FastLSA. In International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS), pages 239-245, June 2000.
5. M. O. Dayhoff, W. C. Barker, and L. T. Hunt.Establishing homologies in protein sequences. Methods in Enzymology, 91:524-545, 1983.
6. A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White, and S. L. Salzberg. Alignment of whole genomes. Nucleic Acids Research, 27(11):2369-2376, 1999.
7. A. L. Delcher, A. Phillippy, J. Carlton, and S. L. Salzberg. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Research, 30(11):2478-2483, 2002.
8. A. Driga. Parallel FastLSA: A parallel algorithm for pairwise sequence alignment. Master's thesis, University of Alberta, 2002.
9. E.W. Edmiston, N.G. Core, J.H. Saltz, and R.M. Smith. Parallel processing of biological sequence comparison algorithms. International Journal of Parallel Programming, 17(3):259-275, June 1988.
10. D. S. Hirschberg. A linear space algorithm for computing longest common subsequences. Communications of the ACM, 18:341-343, 1975.
11. W.S. Martins, J.B. del Cuvillo, F.J. Useche, K.B. Theobald, and G.R. Gao. A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison. In Pacific Symposium on Biocomputing 2001, January 2001.
12. E. Myers and W. Miller. Optimal alignments in linear space. Computer Applications in the Biosciences (CABIOS), 4:11-17, 1988.
13. S. B. Needleman and C. D. Wunsch. A general method applicable to the search of similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
14. Penn State University. Bioinformatics Group. http://bio.cse.psu.edu, 2001.
15. Bioinformatics Group Penn State University. TCR sequences. http://bio.cse.psu.edu/pipmaker/examples.html, 2001.
16. Bioinformatics Group Penn State University. XRCC1 and Myosin sequences. http: //globin.cse.psu.edu/globin/html/pip/examples.html, 2001.
17. N. T. Perna and et al. Genome sequence of enterohaemorrhagic Escherichia coli O157:H7. Nature, 409(6819):529-533, 2001.
18. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.