Pages that link to "Item:Q2266938"
From MaRDI portal
The following pages link to Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938):
Displaying 15 items.
- Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
- New heuristics for rooted triplet consistency (Q1736566) (← links)
- On the hardness of inferring phylogenies from triplet-dissimilarities (Q2465625) (← links)
- Algorithms for combining rooted triplets into a galled phylogenetic network (Q2921689) (← links)
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time (Q3637119) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- (Q5091725) (← links)
- The Worst Case Complexity of Maximum Parsimony (Q5165594) (← links)
- Minimal Triangulation Algorithms for Perfect Phylogeny Problems (Q5404932) (← links)
- Computing the rooted triplet distance between phylogenetic networks (Q5918288) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
