Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse




Journal Article

Molecular phylogenetics: parallelized parameter estimation and quartet puzzling


Schmidt,  Heiko A.
Max Planck Society;

Vingron,  Martin
Gene regulation (Martin Vingron), Dept. of Computational Molecular Biology (Head: Martin Vingron), Max Planck Institute for Molecular Genetics, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Schmidt, H. A., Petzold, E., Vingron, M., & von Haeseler, A. (2003). Molecular phylogenetics: parallelized parameter estimation and quartet puzzling. Special Issue on High-Performance Computational Biology, 719-727. doi:10.1016/S0743-7315(03)00129-1.

Cite as:
Exponential growth of the data available for molecular sequence analysis causes eminent need for methods to analyze large datasets in reasonable time. In molecular phylogenetics maximum-likelihood methods became very popular despite their vast need for computational power. During the last decades parallel computing has proven to be a valuable way to decrease running time of computationally intensive analyses. In this paper we suggest to parallelize the estimation of parameters for evolutionary models and the quartet puzzling algorithm to reconstruct phylogenetic trees from DNA and protein sequences applying the maximum-likelihood principle. Furthermore, we discuss effects of the different parallel granularities of the algorithms.