Abstract
In this work, we present the preliminary step of a novel approach for the construction of phylogenetic trees on large parallel clusters of PCs. Computation of multiple alignments of biological sequences and phylogenetic tree construction are performed simultaneously. Any algorithm built upon this process uses the concept of neighborhood (which can be informally defined as sets of evolutionary related sequences). The process, called PhylTre, schematically consists in three iterative steps: the first step produces an undirected graph from a pre-processing operation. The second step aims at determining a neighborhood for each sequence. The third step builds partial phylogenetic trees using results stemmed from step two. The steps are applied iteratively until the whole phylogenetic tree is obtained.
A sequential code is available and it is currently implemented in parallel on a large cluster of PCs available at ID-IMAG.
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
J. Blazewicz, K. Ecker, B. Plateau, and D. Trystram, editors. Handbook on Parallel and Distributed Processing. Internation Handbooks on Information Systems. Springer-Verlag, feb 2000.
C. Ceron, J. Dopazo, E. L. Zapata, J.-M. Carazo, and O. Trelles. Parallel implementation of dna program on message-passing architectures. Parallel Computing, 24(5-6):710–716, 1998.
SuperTree Challenge. Goal: build a phylogenetic tree from more than 1000 phylogenies containing more than 11,000 taxa. http://www.life.umd.edu/labs/delwiche/deepgreen/DGchallenges.html, June 2001.
M. Csürös. Fast recovery of evolutionary trees with thousands of nodes. In RECOMB 2001. Fifth Annual International Conference on Computational Molecular Biology, Montréal, Canada, april 22–25 2001.
Ribosomal database project. Ribosome data related services. http://rdp.cme.msu.edu/html/, June2001.
J. Felsenstein. Maximum likelihood and minimum-steps methods for estimating evolutionary trees from data on discrete characters. Systemic Zoology, 22:240–249, 1973.
J. Felsenstein. Maximum likelihood estimation of evolutionary trees from continuous characters. Society of Human Genetics, 25:471–492, 1973.
PHYLIP (J. Felsenstein). A free package for inferring phylogenies. Dept of Genetics, University of Washington. http://evolution.genetics.washington.edu/phylip.html, June 2001.
Genbank. Nih genetic sequence database. http://www.ncbi.nlm.nih.gov, April 2001.
J. Jones and K. Yelick. Parallelizing the phylogeny problem. In Super-computing (SC’95), dec. 3–8, San Diego (USA), 1995.
B. Moret, L.-S. Wang, T. Warnow, and S. Wyman. New approaches for reconstructing phylogenies from gene order data. In Intelligent Systems for Molecular Biology (ISMB’01), Copenhagen, Denmark, 22–25 july 2001.
G. Olsen, H. Matsuda, R. Hagstrom, and R. Overbeek. fastDNAml: a tool for construction of phylogenetic trees of DNA sequences using maximum likelihood. Computer Applications in the Biosciences (CABIOS), 10:41–48, 1994.
D. Polychronopoulos. Static and Dynamic Loop Scheduling. In Parallel Programming and Compilers. Kluwer Academic Publishers, 1989.
Green plant phylogeny. Goal: reconstruct the evolutionary relationships among all green plants. http://ucjeps.berkeley.edu/bryolab/GPphylo/GPproject.html, June 2001.
[STB+99]_C. Stewart, T. Tan, M. Buchhorn, D. Hart, D. Berry, L. Zhang, E. Wern-ert, M. Sakharkarand W. Fisher, and D. McMullen. Evolutionary biology and computational grids. In IBM CASCON 1999 Computational Biology Workshop: Software Tools for Computational Biology, 1999.
TreeBASE. A relational database of phylogenetic information. http://www.herbaria.harvard.edu/treebase, June 2001.
O. Trelles-Salazar, E. L. Zapata, and J.-M. Carazo. Mapping strategies for sequential sequence comparison algorithms on LAN-bases message passing architectures. In High Performance Computing and Networking’ 94, volume 796 of Lecture Notes in Computer Science (LNCS), pages 197–202. Springer-Verlag, Berlin, 1994.
C. Venter, M. Adams, and E. Myers et al. The sequence of the human genome. Science Magazine, 291, 2001.
T. K. Yap, P. J. Munson, O. Frieder, and R. L. Martino. Parallel multiple sequence alignment using speculative computation. In Internation Conference on Parallel Processing (ICPP’95), 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guinand, F., Parmentier, G., Trystram, D. (2002). Construction of Phylogenetic Trees on Parallel Clusters. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_24
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive