Parallel multiple sequences alignment in SMP cluster

Proceedings - Eighth International Conference on High-Performance Computing in Asia-Pacific Region, HPC Asia 2005

Volumn 2005, Issue , 2005, Pages 426-431

  Tan, Guangming ^a,b   Feng, Shengzhong ^a   Sun, Ninghui ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPLE SEQUENCES; MULTIPLE SEQUENCES ALIGNMENT ALGORITHM; SMP CLUSTER;

ALGORITHMS; DNA SEQUENCES; MOLECULAR BIOLOGY; PROBLEM SOLVING; PROTEINS; TREES (MATHEMATICS);

COMPUTATIONAL METHODS;

EID: 33847136477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCASIA.2005.70     Document Type: Conference Paper

References (16)

1. D. T. Julie, G. H. Desmond and J. G. Toby. Clustal W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research, 1994, Vol. 22, No. 22, pp. 4673-4680.
2. L. Wang, T. Jiang and D. Gusfield. A more efficient approximation scheme for tree alignment. SIAM Journal of Computer, 2001, Vol. 30, pp. 283-299.
3. S. Altschul and D. Lipman. Trees, stars, and multiple sequences alignment. SIAM Journal of Applicated Mathematics, 1989, Vol. 49, pp. 197-209.
4. H. Carrillo and D. Lipman. The multiple sequence alignment problem in biology. SIAM Journal of Applicated Mathematics, 1988, Vol. 48, pp. 1073-1082.
5. D. Gusfield. Algorithms on String, Trees, and Sequences: Computer Science and Computational Biology. New York: Cambridge University Press, 1997.
6. D. Sankoff and J. Kruskal. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, MA: Addison Wesley, 1983.
7. D. Henikoff. Approximation Algorithms for NP-hard Problems. PWS publishers, 1996.
8. M. McClure, T. Vasi and C. E. Lawrence. Comparative analysis of multiple protein-sequence alignment methods. Molecular Biology and Evoluation, 1994, Vol. 11, No. 14, pp. 571-592.
9. D. Feng and R. F. Doolittle. Progressive sequence alignment as prerequisite to correct phylogenetic trees. Journal of Molecular Evolution, 1987, Vol. 25, pp. 351-360.
10. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolutoin, 1987, Vol. 4, pp. 406-425.
11. D. Mikhailov, H. Cofer and R. Gomperts. Performance optimization of ClustalW: Parallel ClustalW, HT Clustal and MULTICLUSTAL. White papers, SGI, 2001.
12. O. Duzlevski. SMP version of ClustalW 1.82. http://bioinfor.pbi.nrc.ca/ clustalw-smp.
13. J. J. Cheetham, F. Dehne, S. Pitre, A. R. Chaplin and P. J. Tailon. Parallel CLUSTALW for PC Clusters. Proceedings of International Conference on Computational Science and its Applications, Montreal, Canada, May 18-21, 2003.
14. T. Hagerup. Allocating independent tasks to parallel processors: an experimental strudy. Journal of Parallel and Distributed Computing, 1997, Vol. 47, pp. 185-197.
15. C. Franck and E. Daniel. MPI versus MPI+OpenMP on the IBM SP for the NAS Benchmarks. The International Conference on Supercomputing, 2000.
16. K Hwang, Zhiwei Xu. Scalable Parallel Computing: Technology,Architecture, Programming. McGraw-Hill,1999.