Problemcore
Small parsimony problem
Also called Fitch problem, weighted small parsimony.
Given a fixed tree and leaf states, compute the minimum number of changes and optimal internal labels.
Given a fixed tree and leaf states, compute the minimum number of changes and optimal internal labels.
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 Q07R6W Edit this page History Report an error