Abstract
A phylogenetic tree construction is one of the most important problems in computational biology. From computational point of view it is also one of the most difficult problem because of its intrinsic intractability. Efficient algorithms are known only for some special cases of the problem which are unrealistic from biological point of view. Many algorithms are known for the problem, but since the problem is hard, they are usually heuristics. In this paper we present three exact parallel algorithms for the problem. They have been tested in computational experiment ran on SUN Fire computer.
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
Fitch, W.M.: Toward defining the course of evolution: minimum change for a specified tree topology. Systematic Zoology 20, 406–416 (1971)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. In: Computer Science and Computational Biology, Cambridge University Press, Cambridge (1997)
PHYLIP Home Page, http://evolution.genetics.washington.edu/phylip.html
Setubal, J., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing Company, Boston (1997)
Waterman, M.S.: Introduction to Computational Biology. In: Maps, Sequences and Genomes, Chapman & Hall, London (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Błażewicz, J., Formanowicz, P., Kędziora, P., Wojciechowski, P. (2004). Parallel Algorithms for Evolutionary History Reconstruction. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_146
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_146
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive