New results on optimizing rooted triplets consistency
From MaRDI portal
(Redirected from Publication:708349)
Recommendations
- New Results on Optimizing Rooted Triplets Consistency
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- scientific article; zbMATH DE number 7564377
- New heuristics for rooted triplet consistency
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1945190 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 1444316 (Why is no real title available?)
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
- A supertree method for rooted trees
- Algorithmic construction of sets for k -restrictions
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Analytic solutions for three taxon ML trees with variable rates across sites
- Computing a smallest multi-labeled phylogenetic tree from rooted triplets
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- Constructing the maximum consensus tree from rooted Triples
- Determining the Evolutionary Tree Using Experiments
- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
- Hardness of fully dense problems
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Maximum agreement and compatible supertrees
- On the complexity of constructing evolutionary trees
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Ranking Tournaments
- Reconstruction of rooted trees from subtrees
- Rooted maximum agreement supertrees
- The complexity of reconstructing trees from qualitative characters and subtrees
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Cited in
(30)- Kernel and fast algorithm for dense triplet inconsistency
- Kernel and fast algorithm for dense triplet inconsistency
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- Complexity insights of the minimum duplication problem
- New heuristics for rooted triplet consistency
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- Trinets encode tree-child and level-2 phylogenetic networks
- On the weighted quartet consensus problem
- The matroid structure of representative triple sets and triple-closure computation
- Complexity insights of the minimum duplication problem
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Constructing the maximum consensus tree from rooted Triples
- Binets: fundamental building blocks for phylogenetic networks
- Reconstructing minimal rooted trees.
- scientific article; zbMATH DE number 7564377 (Why is no real title available?)
- Computing a smallest multi-labeled phylogenetic tree from rooted triplets
- Deciding the closure of inconsistent rooted triples is NP-complete
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
- New Results on Optimizing Rooted Triplets Consistency
- Building a small and informative phylogenetic supertree
- Orthology relations, symbolic ultrametrics, and cographs
- Constructing a consensus phylogeny from a leaf-removal distance (extended abstract)
- Constructing the R* consensus tree of two trees in subcubic time
- Complexity of modification problems for best match graphs
- Optimizing phylogenetic supertrees using answer set programming
- Comparing and aggregating partially resolved trees
- Fitting metrics and ultrametrics with minimum disagreements
- Gene tree correction for reconciliation and species tree inference: complexity and algorithms
- Resolving rooted triplet inconsistency by dissolving multigraphs
This page was built for publication: New results on optimizing rooted triplets consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708349)
