Data structurecore
k-mer index
Also called k-mer table, seed index.
Map from every length-k substring to its occurrence positions, used to find seeds.
Map from every length-k substring to its occurrence positions, used to find seeds.
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 3PGQMC Edit this page History Report an error