Tree Contractions and Evolutionary Trees

DOI10.1137/S0097539795283504MaRDI QIDQ4210124zbMATH OpenFDO

Authors Ming-Yang Kao

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

computational biologyevolutionary treesagreement subtreeminimal condensed formstree contractions

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) General biology and biomathematics (92B05)

Recommendations

• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• An improved algorithm for the maximum agreement subtree problem
• scientific article; zbMATH DE number 1003280

Cited in

(8)

• Computing the maximum agreement of phylogenetic networks
• An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
• From constrained to unconstrained maximum agreement subtree in linear time
• Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
• Average case analysis for tree labelling schemes
• The asymmetric median tree. --- A new model for building consensus trees
• Improved algorithms for maximum agreement and compatible supertrees
• An improved algorithm for the maximum agreement subtree problem

This page was built for publication: Tree Contractions and Evolutionary Trees

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