TY - JOUR
AU - Hendy, Michael, D.
AB - Abstract 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 × 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. This content is only available as a PDF. © 1987 IRL Press Ltd.
TI - Turbo Tree: a fast algorithm for minimal trees
JF - Bioinformatics
DO - 10.1093/bioinformatics/3.3.183
DA - 1987-09-01
UR - https://www.deepdyve.com/lp/oxford-university-press/turbo-tree-a-fast-algorithm-for-minimal-trees-MZg0PAWu6g
SP - 183
VL - 3
IS - 3
DP - DeepDyve
ER -