Pages that link to "Item:Q1306398"
From MaRDI portal
The following pages link to On the complexity of constructing evolutionary trees (Q1306398):
Displayed 16 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)
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
- New heuristics for rooted triplet consistency (Q1736566) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← 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)
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- (Q5091725) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)