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