Branch and bound algorithms to determine minimal evolutionary trees

DOI10.1016/0025-5564(82)90027-XzbMath0488.92004WikidataQ56059382 ScholiaQ56059382MaRDI QIDQ1166450

David Penny, Michael D. Hendy

Publication date: 1982

Published in: Mathematical Biosciences (Search for Journal in Brave)

zbMATH Keywords

protein sequencesbranch and bound algorithmsphylogenetic treesminimal evolutionary trees

Mathematics Subject Classification ID

Trees (05C05) Enumerative combinatorics (05A99) Genetics and epigenetics (92D10) General biology and biomathematics (92B05)

Related Items

On joint subtree distributions under two evolutionary models ⋮ Characterizing local optima for maximum parsimony ⋮ Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts ⋮ Probabilistic models in cluster analysis ⋮ Edge lengths of trees from sequence data ⋮ A tabu search algorithm for maximum parsimony phylogeny inference ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ The arithmetic topology of genetic alignments ⋮ Branch and bound algorithms to determine minimal evolutionary trees ⋮ Mathematical properties of the gene duplication cost ⋮ A combinatorial description of the closest tree algorithm for finding evolutionary trees ⋮ On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees ⋮ A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION ⋮ Spectral analysis and a closest tree method for genetic sequences ⋮ Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion ⋮ Spectral analysis of phylogenetic data ⋮ Distributions of cherries for two models of trees

Cites Work

• Unnamed Item
• Branch and bound algorithms to determine minimal evolutionary trees