TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing.
CONCLUSIONS
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.


BACKGROUND
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/).
Schmidt
Heiko A
HA
Max-Planck-Institut für Molekulare Genetik, Ihnestr. 73, D-14195 Berlin, Germany. hschmidt@eva.mpg.de
Strimmer
Korbinian
K
Vingron
Martin
M
von Haeseler
Arndt
A
D000465:Algorithms; D003205:Computing Methodologies; D003628:Database Management Systems; D030541:Databases, Genetic; D020407:Internet; D016013:Likelihood Functions; D008432:Mathematical Computing; D008969:Molecular Sequence Data; D010802:Phylogeny; D017421:Sequence Analysis / Q000379:methods* / Q000706:statistics & numerical data; D012984:Software