Pages that link to "Item:Q3637119"
From MaRDI portal
The following pages link to Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time (Q3637119):
Displaying 8 items.
- 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)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- When two trees go to war (Q2261656) (← links)
- Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks (Q2304069) (← links)
- Encoding and constructing 1-nested phylogenetic networks with trinets (Q2375949) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
