Problemcore
Ultrametric tree reconstruction
Also called ultrametric fitting.
Given a distance matrix, find a rooted tree with equal leaf-to-root distances that best fits it.
Given a distance matrix, find a rooted tree with equal leaf-to-root distances that best fits it.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DAQVWC Edit this page History Report an error