State, transition, order, and how much of the table has to be kept. That last question is where the space savings live, and it is what separates the one-dimensional cases from the rest.
3 implementations.
| Implementation | Language |
|---|---|
| Bitmask and interval dynamic programming | C++ |
| One-dimensional dynamic programming | C++ |
| Sequence alignment | C++ |
Every file here was written for this repository and verifies itself; see patterns/ for the extracts from earlier work.