Tree Contractions and Evolutionary Trees
From MaRDI portal
Publication:4210124
DOI10.1137/S0097539795283504zbMath0915.05046MaRDI QIDQ4210124
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
evolutionary trees; computational biology; agreement subtree; minimal condensed forms; tree contractions
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05C90: Applications of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
92B05: General biology and biomathematics
Related Items
The asymmetric median tree. --- A new model for building consensus trees, Improved algorithms for maximum agreement and compatible supertrees, An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees, An improved algorithm for the maximum agreement subtree problem, Computing the maximum agreement of phylogenetic networks, Average case analysis for tree labelling schemes, From constrained to unconstrained maximum agreement subtree in linear time