Abstract
Multiple Sequence Alignment is an essential tool in the analysis and comparison of biological sequences. Unfortunately, the complexity of this problem is exponential. Currently feasible methods are, therefore, only approximations. The progressive multiple sequence alignment algorithms are the most widespread among these approximations. Still, the computation speed of typical problems is often not satisfactory. Hence, the well known progressive alignment scheme of ClustalW has been subject to parallelization to further accelerate the computation. In the course of this action a unique scheme to parallelize sequence alignment in particular and dynamic programming in general was discovered, which yields an average of n / 2 parallel calculations for problem size n. The scalability of O(n) tasks for problem size n can be even maintained for slower networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hastings, N.A.J.: Dynamic Programming: With Management Applications, Butterworths (1973)
Needleman, S.B., Wunsch, C.D.: A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins. Journal of Molecular Biology 48, 443–453 (1970)
Myers, E.W., Miller, W.: Optimal alignments in linear space. Computer Applications in the Biosciences 4, 11–17 (1988)
Higgins, D.G., Sharp, P.M.: CLUSTAL: a package for performing multiple sequence alignment on a microcomputer. Gene 73, 237–244 (1988)
Thompson, J.D., Higgins, D.G., Gibson, T.J.: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 22, 4673–4680 (1994)
Saitou, N., Nei, M.: The Neighbor-joining Method: A New Method for Reconstructing Phylogenetic Trees. Journal of Molecular Biology and Evolution 4, 406–425 (1987)
Studier, J.A., Keppler, K.J.: A Note on the Neighbor-Joining Algorithm of Saitou and Nei. Journal of Molecular Biology and Evolution 5, 729–731 (1988)
Mattson, T.G., Sanders, B.A., Massingil, B.L.: A Pattern Language for Parallel Programming. Addison Wesley, Reading (2004)
Kern, T.: Biomedical Information Systems (2003), http://biomis.fh-hagenberg.at (last visited March 2005)
Pitzer, E.: Acceleration of Progressive Multiple Sequence Alignment by Parallelization and Complexity Reduction of Existing Algorithms. Master’s thesis, University of Applied Sciences Hagenberg, Austria (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pitzer, E. (2005). Parallel Progressive Multiple Sequence Alignment. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556985_61
Download citation
DOI: https://doi.org/10.1007/11556985_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29002-5
Online ISBN: 978-3-540-31829-3
eBook Packages: Computer ScienceComputer Science (R0)