Algorithmcore
Fitch's algorithm
Also called Fitch parsimony.
Two-pass dynamic program computing the unweighted parsimony score of a fixed tree in linear time.
Two-pass dynamic program computing the unweighted parsimony score of a fixed tree in linear time.
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 NYTSYT Edit this page History Report an error