Molecular phylogenetics: parallelized parameter estimation and quartet puzzling

Schmidt, Heiko A.; Petzold, E.; Vingron, Martin; von Haeseler, Arndt

doi:10.1016/S0743-7315(03)00129-1

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Molecular phylogenetics: parallelized parameter estimation and quartet puzzling

MPS-Authors

Schmidt, Heiko A.
Max Planck Society;

/persons/resource/persons50613

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

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: https://hdl.handle.net/11858/00-001M-0000-0010-8A16-F

Abstract

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.