Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
From MaRDI portal
Recommendations
- Algorithms for combining rooted triplets into a galled phylogenetic network
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Computing and Combinatorics
- An efficient algorithm for the rooted triplet distance between galled trees
- New Results on Optimizing Rooted Triplets Consistency
Cited in
(32)- Caterpillars on three and four leaves are sufficient to binary normal networks
- Trinets encode orchard phylogenetic networks
- Trinets encode tree-child and level-2 phylogenetic networks
- When two trees go to war
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization
- Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Computing the rooted triplet distance between galled trees by counting triangles
- Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
- Algorithms for combining rooted triplets into a galled phylogenetic network
- Kernelizations for the hybridization number problem on multiple nonbinary trees
- Constructing the Simplest Possible Phylogenetic Network from Triplets
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- Optimizing tree and character compatibility across several phylogenetic trees
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- On encodings of phylogenetic networks of bounded level
- Computing and Combinatorics
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
- Reconstructing a phylogenetic level-1 network from quartets
- ارائه الگوریتمی نوین برای حل مساله ساخت درخت فیلوژنتیک ریشهدار بر اساس سهتاییهای ریشهدار ورودی
- Phylogenetic Networks
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- A cubic-time algorithm for computing the trinet distance between level-1 networks
- Constructing the simplest possible phylogenetic network from triplets
- Computing the rooted triplet distance between phylogenetic networks
- Resolving unresolved resolved and unresolved triplets consistency problems
- New results on optimizing rooted triplets consistency
- Inferring DAGs and phylogenetic networks from least common ancestors
- All that glisters is not galled
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
This page was built for publication: Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470727)
