Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Penny, D.
Right arrow Articles by Hendy, M. D.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Penny, D.
Right arrow Articles by Hendy, M. D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 1987 IRL Press Ltd.

Turbo Tree: a fast algorithm for minimal trees

David Penny and Michael D. Hendy 1

Department of Botany and Zoology, Massey University Palmerston North, New Zealand
1Department of Mathematics and Statistics, Massey University Palmerston North, New Zealand

A branch and bound algorithm is described for searching rapidly for minimal length trees from biological data. The algorithm adds characters one at a time, rather than adding taxa, as in previous branch and bound methods. The algorithm has been programmed and is available from the authors. A worked example is given with 33 characters and 15 taxa. About 8 x 1012 binary trees are possible with 15 taxa but the branch and bound program finds the minimal tree in <5 min on an IBM PC.

Received on January 15, 1987; accepted on February 23, 1987

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Mol Biol EvolHome page
W. White, S. Hills, R Gaddam, B. Holland, and D. Penny
Treeness Triangles: Visualizing the Loss of Phylogenetic Signal
Mol. Biol. Evol., September 1, 2007; 24(9): 2029 - 2039.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.