Tree Contractions and Evolutionary Trees

DOI10.1137/S0097539795283504zbMath0915.05046MaRDI QIDQ4210124

Ming-Yang Kao

Publication date: 21 September 1998

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

zbMATH Keywords

evolutionary treescomputational biologyagreement subtreeminimal condensed formstree contractions

Mathematics Subject Classification ID

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

Related Items (8)

Average case analysis for tree labelling schemes ⋮ An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees ⋮ Improved algorithms for maximum agreement and compatible supertrees ⋮ From constrained to unconstrained maximum agreement subtree in linear time ⋮ Computing the maximum agreement of phylogenetic networks ⋮ The asymmetric median tree. --- A new model for building consensus trees ⋮ An improved algorithm for the maximum agreement subtree problem ⋮ APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES

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