Pages that link to "Item:Q5470727"
From MaRDI portal
The following pages link to Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network (Q5470727):
Displaying 24 items.
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- On encodings of phylogenetic networks of bounded level (Q455730) (← links)
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- Reconstructing a phylogenetic level-1 network from quartets (Q486621) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- A cubic-time algorithm for computing the trinet distance between level-1 networks (Q522967) (← links)
- Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- All that glisters is not galled (Q733254) (← links)
- Algorithms for visualizing phylogenetic networks (Q2192379) (← links)
- Caterpillars on three and four leaves are sufficient to binary normal networks (Q2204868) (← links)
- Trinets encode orchard phylogenetic networks (Q2232132) (← links)
- Trinets encode tree-child and level-2 phylogenetic networks (Q2249670) (← links)
- When two trees go to war (Q2261656) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
- Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks (Q2304069) (← links)
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters (Q2358415) (← links)
- Encoding and constructing 1-nested phylogenetic networks with trinets (Q2375949) (← links)
- Computing the rooted triplet distance between galled trees by counting triangles (Q2442817) (← links)
- Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations (Q2634749) (← links)
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time (Q3637119) (← links)
- Phylogenetic Networks (Q5118413) (← links)
