Problemadvanced
Perfect phylogeny
Also called perfect phylogeny problem.
Decide whether binary characters admit a tree in which each character changes at most once.
Decide whether binary characters admit a tree in which each character changes at most once.
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 Y9D3XV Edit this page History Report an error