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.
Computer-assisted determination of L(12,3)=36: independent exhaustive C++ and Rust exclusions through length 35 with a verified attributed length-36 witness.
Deterministic short-read assembly and inspectable evidence in Rust
Certified scoped theorem for binary covering sequences: every valid length-70 (9,1) cover uses at most 60 distinct edges in common with one fixed backbone; global bounds unchanged.
To associate your repository with the de-bruijn-graph topic, visit your repo's landing page and select "manage topics."