Pages that link to "Item:Q405205"
From MaRDI portal
The following pages link to Tree reconstruction from triplet cover distances (Q405205):
Displaying 9 items.
- Lassoing and corralling rooted phylogenetic trees (Q376433) (← links)
- `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers (Q455729) (← links)
- Sets of double and triple weights of trees (Q659656) (← links)
- An optimal algorithm to reconstruct trees from additive distance data (Q1121819) (← links)
- Combinatorial properties of triplet covers for binary trees (Q1637594) (← links)
- Minimum triplet covers of binary phylogenetic \(X\)-trees (Q1679026) (← links)
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994) (← links)
- Recovering Trees with Convex Clustering (Q5025783) (← links)
- Distinguished Minimal Topological Lassos (Q5265017) (← links)