The following pages link to (Q4875208):
Displayed 8 items.
- A constructive algorithm for realizing a distance matrix (Q858334) (← links)
- Counting distance permutations (Q1013072) (← links)
- Inferring evolutionary trees with strong combinatorial evidence (Q1575435) (← links)
- \(l_\infty\)-approximation via subdominants. (Q1599172) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- A few logs suffice to build (almost) all trees (I) (Q4238440) (← links)
- Constructing big trees from short sequences (Q4572010) (← links)