TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing

Heiko A. Schmidt, Korbinian Strimmer, Martin Vingron, Arndt von Haeseler

2002Published
2.1KCitations
0References
journal articleType

Abstract

Abstract Summary: TREE-PUZZLE is a program package for quartet-based maximum-likelihood phylogenetic analysis (formerly PUZZLE, Strimmer and von Haeseler, Mol. Biol. Evol. , 13, 964โ€“969, 1996) that provides methods for reconstruction, comparison, and testing of trees and models on DNA as well as protein sequences. To reduce waiting time for larger datasets the tree reconstruction part of the software has been parallelized using message passing that runs on clusters of workstations as well as parallel computers. Availability: http://www.tree-puzzle.de. The program is written in ANSI C. TREE-PUZZLE can be run on UNIX, Windows and Mac systems, including Mac OS X. To run the parallel version of PUZZLE, a Message Passing Interface (MPI) library has to be installed on the system. Free MPI implementations are available on the Web (cf. http://www.lam-mpi.org/mpi/implementations/). Contact: hschmidt@molgen.mpg.de; haeseler@eva.mpg.de * To whom correspondence should be addressed.

Journal: Bioinformatics

Publisher: Oxford University Press (OUP)

Citations are the number of DOI-registered works in Crossref that cite this paper; references are how many works it cites. Full text is on the publisher site via the DOI link.