Branch and bound algorithms to determine minimal evolutionary trees

DOI10.1016/0025-5564(82)90027-XMaRDI QIDQ1166450zbMATH OpenWikidataFDO

Authors David Penny, M. D. Hendy

Publication date 1982

Published in Mathematical Biosciences (Search for Journal in Brave)

zbMATH Keywords

phylogenetic treesbranch and bound algorithmsprotein sequencesminimal evolutionary trees

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3693319 (Why is no real title available?)
• Branch and bound algorithms to determine minimal evolutionary trees

Cited in

(17)

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

This page was built for publication: Branch and bound algorithms to determine minimal evolutionary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1166450)