Branch and bound algorithms to determine minimal evolutionary trees

(Uploaded by Plazi for the Bat Literature Project) Two practical branch and bound algorithms for determining minimal and near-minimal phylogenetic trees from protein sequence data are presented. A mathematical description and analysis of phylogenetic trees introduces these algorithms. A comment on efficiency and fine tuning completes the paper. An example is cited where computer time was reduced from an estimated 55 days for a total search, to just under 5 minutes.