%0 Journal Article %1 Schmidt:2002:Bioinformatics:11934758 %A Schmidt, H A %A Strimmer, K %A Vingron, M %A von Haeseler, A %D 2002 %J Bioinformatics %K bio %N 3 %P 502-504 %T TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing %U http://www.ncbi.nlm.nih.gov/pubmed/11934758 %V 18 %X 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/).

@article{Schmidt:2002:Bioinformatics:11934758, 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/).}, added-at = {2011-04-19T12:52:15.000+0200}, author = {Schmidt, H A and Strimmer, K and Vingron, M and von Haeseler, A}, biburl = {https://www.bibsonomy.org/bibtex/25b2885d5526814aa356c014ba9adc74d/lutzm}, description = {TREE-PUZZLE: maximum likelihood phylogenetic analy... [Bioinformatics. 2002] - PubMed result}, interhash = {94211bf690513708785bd2fa3b9cb9a9}, intrahash = {5b2885d5526814aa356c014ba9adc74d}, journal = {Bioinformatics}, keywords = {bio}, month = mar, number = 3, pages = {502-504}, pmid = {11934758}, timestamp = {2011-04-19T12:52:15.000+0200}, title = {TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing}, url = {http://www.ncbi.nlm.nih.gov/pubmed/11934758}, volume = 18, year = 2002 }