The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
From MaRDI portal
Publication:2942263
Recommendations
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- New results on optimizing rooted triplets consistency
- New Results on Optimizing Rooted Triplets Consistency
- Resolving rooted triplet inconsistency by dissolving multigraphs
- New heuristics for rooted triplet consistency
Cites work
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
- Analytic solutions for three taxon ML trees with variable rates across sites
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- Constructing the maximum consensus tree from rooted Triples
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- New results on optimizing rooted triplets consistency
- On the complexity of constructing evolutionary trees
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- The complexity of reconstructing trees from qualitative characters and subtrees
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Cited in
(5)- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- Determining the consistency of resolved triplets and fan triplets
- New Results on Optimizing Rooted Triplets Consistency
- New results on optimizing rooted triplets consistency
- Resolving rooted triplet inconsistency by dissolving multigraphs
This page was built for publication: The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942263)