A fast linear-space sequence alignment algorithm with dynamic parallelization framework

Proceedings - IEEE 9th International Conference on Computer and Information Technology, CIT 2009

Volumn 1, Issue , 2009, Pages 274-279

  Xiaochun, Ye ^a   Dongrui, Fan ^a   Wei, Lin ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

Dynamic parallelization framework; Linear space algorithm; Sequence alignment

Indexed keywords

LARGE-SCALE SEQUENCES; LINEAR SPACES; PAIRWISE SEQUENCE ALIGNMENT; PARALLELIZATIONS; SEQUENCE ALIGNMENTS; SIMILARITY MATRIX; SPACE AND TIME; START POINT; SUB-PROBLEMS; SYMMETRIC MULTI-PROCESSORS;

ALGORITHMS; ALIGNMENT; DNA SEQUENCES; INFORMATION TECHNOLOGY; SHAPE MEMORY EFFECT;

COMPUTATIONAL EFFICIENCY;

EID: 73449131197     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIT.2009.71     Document Type: Conference Paper

References (15)

1. T.F. Smith, M.S. Waterman. Identification of common molecular subsequences. Jounal of Molecular Biology, 1981, 147(1), pp. 195-197
2. S.B. Needleman, C.D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Jounal of Molecular Biology , 1970, (48), 443-453
3. S. Altschul, T. Madden, A. Schaffer, J. Zhang, Z. Zhang, W. Miller, D. Lipman. Gapped BLAST and PSI-BLAST : A new generation of protein database search programs. Nucleic Acids Research, Vol. 25, No. 17, pp. 3389-3402, 1997.
4. W.R. Pearson and D.J. Lipman. Improved Tools for Biological Sequence Comparison. Proc. Natl. Acad. Sci., 1988, 85: 2444-2448.
5. D.S. Hirschberg. A linear space algorithm for computing longest common subsequences. Communications of the ACM, 18:341-343, 1975.
6. E. Myers and W. Miller. Optimal alignments in linear space. In CABIOS, 4:11-17, 1988.
7. A. Driga, P. Lu, J. Schaeffer, D. Szafron, K. Charter and I. Parsons. FastLSA: a fast, linear-space, parallel and sequential algorithm for sequence alignment. In ICPP, 2003.
8. E. Li, C. Xu, T. Wang, L. Jin and Y. Zhang. Parallel linear space algorithm for large-scale sequence alignment. In Euro-Par, 2005.
9. S. Aluru, N. Futamura, and K. Mehrota. Parallel biological sequence comparison using prefix computation. Journal of Parallel and Distributed Computing, 63:264-272, 2003.
10. A.R. Galper and D.R. Brutlag. Parallel similarity search and alignment with the dynamic programming method, Technical Report KSL 74-90, Stanford University, 1990.
11. A. Sarje and S. Aluru. Parallel biological sequence alignments on the cell broadband engine. IPDPS, 2008
12. 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.
13. W.S. Martin, J.B. Delcuvillo, 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. Hawaii, 2001.
14. http://www.expasy.ch/sprot/
15. Penn State University. Bioinformatics Group. http://bio.cse.psu.edu