Algorithmcore
Semi-global dynamic programming
Also called overlap alignment algorithm, fitting alignment algorithm.
Needleman-Wunsch with zero-cost initialization and termination at chosen ends.
Needleman-Wunsch with zero-cost initialization and termination at chosen ends.
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 GQAPYM Edit this page History Report an error