Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
From MaRDI portal
Publication:4376196
DOI10.1137/S0097539794269461zbMath0885.68071MaRDI QIDQ4376196
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD, Generalized LCS, A constructive algorithm for realizing a distance matrix, Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species, Kernelization and parameterized algorithms for covering a tree by a set of stars or paths, Improved algorithms for maximum agreement and compatible supertrees, On the extremal maximum agreement subtree problem, The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics, Comparison of alignment free string distances for complete genome phylogeny, Tree edit distance and maximum agreement subtree, Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees, Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract), Maximum agreement and compatible supertrees, Computing the maximum agreement of phylogenetic networks, An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation, An algebraic view of the relation between largest common subtrees and smallest common supertrees, Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition, On the complexity of comparing evolutionary 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, On the Maximum Agreement Subtree Conjecture for Balanced Trees
