Optimised fine and coarse parallelism for sequence homology search

International Journal of Bioinformatics Research and Applications

Volumn 2, Issue 4, 2006, Pages 430-441

  Meng, Xiandong ^a   Chaudhary, Vipin ^b  

^a Wayne State University   (United States)

^b WAYNE STATE UNIVERSITY   (United States)

Author keywords

Bioinformatics research and applications; Cluster computing; Coarse grain parallelism; FASTA; Fine grain parallelism; Sequence homology search; Smith Waterman algorithm; SSE2

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; BIOINFORMATICS; CONFERENCE PAPER; SEQUENCE DATABASE; SEQUENCE HOMOLOGY;

EID: 33846128170     PISSN: 17445458     EISSN: 17445493     Source Type: Journal    
DOI: 10.1504/IJBRA.2006.011041     Document Type: Conference Paper

References (20)

1. Altschul, S.F., Gish, W., Miller, W., Myers, E.W. and Lipman, D.J. (1990) 'Basic local alignment search tool', J. Mol. Biol., Vol. 215, pp.403-410.
2. Chaudhary, V., Liu, F., Meng, X., Matta, V., Nambiar, A., Yadav, G. and Yang, L.T. (2006) 'Parallel implementations of local sequence alignment: hardware and software', in Zomaya, A.Y. (Ed.): Parallel Computing in Bioinformatics and Computational Biology, ISBN: 0-471-71848-3.
3. Gotoh, O. (1982) 'An improved algorithm for matching biological sequences', J. Mol. Biol., Vol. 162, pp.705-708.
4. Grate, L., Diekhan, M., Dahle, D. and Hughey, H. (2001) 'Sequence analysis with the kestrel SIMD parallel processor', Pacific Symposium on Biocomputing, pp.263-274.
5. Hughey, R. (1996) 'Parallel hardware for sequence comparison and alignment', Comput. Appl. Biosci., Vol. 12, pp.473-479.
6. IA-32 Intel® (2004) Architecture Software Developer's Manual Volume I: Basic Architecture.
7. Janaki, C. and Joshi, R.R. (2003) 'Accelerating comparative genomics using parallel computing', Silico Biology, Vol. 3, pp.429-440.
8. Meng, X. and Chaudhary, V. (2004) 'Bio-sequence analysis with cradle's 3SoC software scalable system on chip', Proceedings of the ACM Symposium on Applied Computing (SAC) SAC'04, March 14-17, Nicosia, Cyprus, pp.202-206.
9. Needleman, S. and Wunsch, C. (1970) 'A general method applicable to the search for similarities in the amino acid sequence of two sequences', J. Mol. Biol., Vol. 48, No. 3, pp.443-453.
10. Pearson, W.R. (1990) 'Rapid and sensitive sequence comparison with FASTP and FASTA', Methods Enzymol., Vol. 183, pp. 63-98.
11. Pearson, W.R. (1991) 'Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-waterman and FASTA algorithms', Genomics, Vol. 11, pp.635-650.
12. Rogens, T. and Seeberg, E. (2000) 'Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors', Bioinformatics, Vol. 16, pp.699-706.
13. Schmidt, B., Schroder, H. and Schimmler, M. (2002) 'Massively parallel solutions for molecular sequence analysis', 16th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2002 Workshops), Ft Lauderdale, FL, USA, pp.186-193.
14. Smith, T.F. and Waterman, M.S. (1981) 'Identification of common molecular subsequences', J. Mol. Biol., Vol. 147, pp. 195-197.
15. Trelles, O. (2001) On the parallelization of bioinformatic application', Briefings in Bioinformatics, Vol. 2, No. 2, pp.181-194.
16. Yamaguchi, Y. and Maruyama, T. (2002) 'High speed homology search with FPGA', 7th Pacific Symposium on Biocomputing (PSB 2002), Lihue, Hawaii, USA, pp.271-282.
17. Argonne National Laboratory, MPICH - A portable implementation of MPI, http://wwwunix. mcs.anl.gov/mpi/mpich.
18. EBIFASTA Programs download ftp://ftp.ebi.ac.uk/pub/software/unix/fasta/.
19. NCBI DATABASE download http://www.ncbi.nlm.nih.gov/Ftp/index.html.
20. UniProt, the Universal protein resource, http://www.pir.uniprot.org/ database/download.shtml.