Maximum agreement and compatible supertrees
From MaRDI portal
Publication:2466022
Recommendations
- Combinatorial Pattern Matching
- Improved algorithms for maximum agreement and compatible supertrees
- scientific article; zbMATH DE number 1746436
- Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
- LATIN 2004: Theoretical Informatics
- Rooted maximum agreement supertrees
- Fixed-parameter algorithms for finding agreement supertrees
- Fixed-Parameter Algorithms for Finding Agreement Supertrees
- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
- The maximum agreement subtree problem
Cites work
- Algorithms and Computation
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
- An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
- Approximating the domatic number
- Computing and Combinatorics
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- Efficient probabilistically checkable proofs and applications to approximations
- Extension operations on sets of leaf-labelled trees
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time
- Finding a maximum compatible tree is NP-hard for sequences and trees
- Finding largest subtrees and smallest supertrees
- scientific article; zbMATH DE number 1945190 (Why is no real title available?)
- scientific article; zbMATH DE number 1947052 (Why is no real title available?)
- scientific article; zbMATH DE number 1974600 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 1405800 (Why is no real title available?)
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Introduction to algorithms
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- On the complexity of comparing evolutionary trees
- On the complexity of constructing evolutionary trees
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Rooted maximum agreement supertrees
Cited in
(17)- Gene tree correction for reconciliation and species tree inference: complexity and algorithms
- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
- Kernel and fast algorithm for dense triplet inconsistency
- scientific article; zbMATH DE number 1305085 (Why is no real title available?)
- scientific article; zbMATH DE number 1947052 (Why is no real title available?)
- scientific article; zbMATH DE number 1746436 (Why is no real title available?)
- scientific article; zbMATH DE number 1420917 (Why is no real title available?)
- On the Maximum Agreement Subtree Conjecture for Balanced Trees
- Finding smallest supertrees under minor containment
- Fixed-Parameter Algorithms for Finding Agreement Supertrees
- Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees
- Combinatorial Pattern Matching
- LATIN 2004: Theoretical Informatics
- Building a small and informative phylogenetic supertree
- Improved algorithms for maximum agreement and compatible supertrees
- New results on optimizing rooted triplets consistency
- Rooted maximum agreement supertrees
This page was built for publication: Maximum agreement and compatible supertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466022)
