On the fixed parameter tractability of agreement-based phylogenetic distances
From MaRDI portal
(Redirected from Publication:504072)
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)
Recommendations
- Fixed-parameter algorithms for maximum agreement forests
- A cluster reduction for computing the subtree distance between phylogenies
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- Treewidth distance on phylogenetic trees
Cites work
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- A cluster reduction for computing the subtree distance between phylogenies
- Bounding the number of hybridisation events for a consistent evolutionary history
- Computing the minimum number of hybridization events for a consistent evolutionary history
- Fast Algorithms for Finding Nearest Common Ancestors
- Faster exact computation of rSPR distance
- Fixed-parameter algorithms for maximum agreement forests
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- On the complexity of comparing evolutionary trees
- On the computational complexity of the rooted subtree prune and regraft distance
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Parameterized and approximation algorithms for the MAF problem in multifurcating trees
- Subtree transfer operations and their induced metrics on evolutionary trees
- When two trees go to war
Cited in
(20)- On the maximum parsimony distance between phylogenetic trees
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm
- A cluster reduction for computing the subtree distance between phylogenies
- Fixed-parameter tractability for the tree assembly problem
- Exploring the tiers of rooted phylogenetic network space using tail moves
- Fixed-parameter algorithms for maximum agreement forests
- Treewidth distance on phylogenetic trees
- On the hardness of inferring phylogenies from triplet-dissimilarities
- Better practical algorithms for rSPR distance and hybridization number
- Treewidth of display graphs: bounds, brambles and applications
- A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
- Computing maximum agreement forests without cluster partitioning is folly
- Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics
- Reflections on kernelizing and computing unrooted agreement forests
- The agreement distance of unrooted phylogenetic networks
- New reduction rules for the tree bisection and reconnection distance
- scientific article; zbMATH DE number 7205098 (Why is no real title available?)
- Phylogenetic incongruence through the lens of monadic second order logic
- Scanning phylogenetic networks is NP-hard
This page was built for publication: On the fixed parameter tractability of agreement-based phylogenetic distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504072)
