Pages that link to "Item:Q1306398"
From MaRDI portal
The following pages link to On the complexity of constructing evolutionary trees (Q1306398):
Displaying 30 items.
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) (← links)
- Computational complexity of inferring phylogenies from dissimilarity matrices (Q1091978) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
- New heuristics for rooted triplet consistency (Q1736566) (← links)
- Constructing the maximum consensus tree from rooted Triples (Q1768596) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- Finding a maximum compatible tree is NP-hard for sequences and trees (Q1921170) (← links)
- The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees (Q1962070) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
- Faster exact computation of rSPR distance (Q2343983) (← links)
- Encoding and constructing 1-nested phylogenetic networks with trinets (Q2375949) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model (Q2784459) (← links)
- Aligning sequences via an evolutionary tree: complexity and approximation (Q2817672) (← links)
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
- The Complexity of Rooted Phylogeny Problems (Q3224696) (← links)
- Finding a maximum likelihood tree is hard (Q3455214) (← links)
- Constructing Evolutionary Trees in the Presence of Polymorphic Characters (Q4268873) (← links)
- Complexity of Hierarchical Trees in Evidence Theory (Q4291498) (← links)
- (Q4304358) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- (Q5091725) (← links)
- Research in Computational Molecular Biology (Q5706873) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)