Turbo Tree: a fast algorithm for minimal trees |
| |
Authors: | Penny, David Hendy, Michael D. |
| |
Affiliation: | Department of Botany and Zoology, Massey University Palmerston North, New Zealand 1Department of Mathematics and Statistics, Massey University Palmerston North, New Zealand |
| |
Abstract: | A branch and bound algorithm is described for searching rapidlyfor minimal length trees from biological data. The algorithmadds characters one at a time, rather than adding taxa, as inprevious branch and bound methods. The algorithm has been programmedand is available from the authors. A worked example is givenwith 33 characters and 15 taxa. About 8 x 1012 binary treesare possible with 15 taxa but the branch and bound program findsthe minimal tree in <5 min on an IBM PC. Received on January 15, 1987; accepted on February 23, 1987 |
| |
Keywords: | |
本文献已被 Oxford 等数据库收录! |
|