Data structurecore
de Bruijn graph
Also called De Bruijn graph, de Bruijn graph of k-mers, de Bruijn graph of order k.
Graph whose vertices are (k-1)-mers and whose edges are k-mers of the reads.
Graph whose vertices are (k-1)-mers and whose edges are k-mers of the reads.
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 ZCP03V Edit this page History Report an error