Abstract
Sequence alignment is one of the most important fundamental operations in bioinformatics. It has been successfully applied to predict the function, structure and evolution of biological sequences. In this paper, the sequence alignment algorithms based on dynamic programming are analyzed and compared. We present a parallel algorithm for pairwise alignment and implement it on a clustering system with MPI. The experimental results demonstrate the effectiveness in performance promotion. We encapsulate the algorithm into a grid service for practical use.
Chapter PDF
Similar content being viewed by others
8. References
Andreas D. Baxevanis, B. F. Francis Ouellette. “Bioinformatics: the practical guide for analysis of genomics and proteomics”. Tsinghua University Press. 2000
Borja Sotomayor. “The Globus Toolkit 3 Programmer’s Tutorial”. 2004.
Cyntbia Gibas, Per Jambeck. “The computer technology in bioinformatics”. China Dianli Press. 2002
C. Xavier, S.S. Iyengar. “Introduction to the parallel algorithm”. China Machine Press. 2004
D. S. Hirschberg. “A Linear Space Algorithm for Computing Maximal Common Subsequences”. Comm. ACM, vol. 18, no. 6, pp. 341–343, 1975
E. W. Mayers, W. Miller. “Optimal Alignments in Linear Space”. Computer Applications in the Biosciences, vol. 4, no. 1, pp. 11–17, 1988
Joshy Joseph, Craig Fellenstein. “Grid Computing”. Tsinghua University Press. 2005
O. Gotoh. “An Improved Algorithm for Matching Biological Sequences”. J. Molecular Biology, vol. 162, pp. 705–708, 1982
S. B. Needleman, C. D. Wunsch. “A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins”. J. Molecular Biology, vol. 48, pp. 443–453, 1970
T. F. Smith, M. S. Waterman. “Identification of Common Molecular Subsequences”. J. Molecular Biology, vol. 147, pp. 195–197, 1981
Zhihui Du. “High-performance computing and parallel programming technology: MPI parallel programming”. Tsinghua University Press. 2001
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Chen, Y., Yu, S., Leng, M. (2006). Parallel Sequence Alignment Algorithm for Clustering System. In: Wang, K., Kovacs, G.L., Wozny, M., Fang, M. (eds) Knowledge Enterprise: Intelligent Strategies in Product Design, Manufacturing, and Management. PROLAMAT 2006. IFIP International Federation for Information Processing, vol 207. Springer, Boston, MA . https://doi.org/10.1007/0-387-34403-9_43
Download citation
DOI: https://doi.org/10.1007/0-387-34403-9_43
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34402-7
Online ISBN: 978-0-387-34403-4
eBook Packages: Computer ScienceComputer Science (R0)