Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
From MaRDI portal
Publication:4376196
Recommendations
- Combinatorial Pattern Matching
- Computing the maximum agreement of phylogenetic networks
- Computing the maximum agreement of phylogenetic networks
- An improved algorithm for the maximum agreement subtree problem
- Improved algorithms for maximum agreement and compatible supertrees
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- Algorithms and Computation
- Aligning sequences via an evolutionary tree: complexity and approximation
- On the approximability of the maximum agreement subtree and maximum compatible tree problems
Cited in
(24)- Computing the maximum agreement of phylogenetic networks
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
- scientific article; zbMATH DE number 1615275 (Why is no real title available?)
- A constructive algorithm for realizing a distance matrix
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- On the Maximum Agreement Subtree Conjecture for Balanced Trees
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
- Tree edit distance and maximum agreement subtree
- Maximum agreement and compatible supertrees
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Algorithms and Computation
- Finding smallest supertrees under minor containment
- On the approximability of the maximum agreement subtree and maximum compatible tree problems
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
- Improved algorithms for maximum agreement and compatible supertrees
- Constructing a consensus phylogeny from a leaf-removal distance (extended abstract)
- Comparison of alignment free string distances for complete genome phylogeny
- Generalized LCS
- On the complexity of comparing evolutionary trees
- An improved algorithm for the maximum agreement subtree problem
- On the extremal maximum agreement subtree problem
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
This page was built for publication: Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376196)
