On the agreement of many trees
From MaRDI portal
Publication:1352115
DOI10.1016/0020-0190(95)00110-XzbMath0875.68693MaRDI QIDQ1352115
Mikkel Thorup, Martin Farach, Teresa M. Przytycka
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
Related Items
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD, The asymmetric median tree. --- A new model for building consensus trees, Improved algorithms for maximum agreement and compatible supertrees, Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species, An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation, On the approximability of the maximum agreement subtree and maximum compatible tree problems, An improved algorithm for the maximum agreement subtree problem, On the agreement of many trees, Computing the maximum agreement of phylogenetic networks, Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Cites Work