de-bruijn-graph

Deterministic Rust de Bruijn assembler for streamed gzip FASTA/FASTQ, with quality filtering and paired-end/multi-lane support.

Assemble a genome from k-mers with a de Bruijn graph and Eulerian path from scratch; shows why k must exceed the repeat length.

Certified length-70 binary (9,1) fixed-backbone theorem: every valid cover uses at most 60 distinct edges of one explicit 64-edge backbone; global bounds unchanged.