Eric Coissac 86e9cb7026 refactor: improve de Bruijn graph traversal and longtig generation ...

- Refactored Node representation using compact bitfields for neighbor counts
  and nucleotides; added count_neighbors helper to compute_degrees()
- Introduced StartIter iterator for unitig/longtigu generation with revised
  traversal semantics (e.g., interior node marking)
- Added nucleotide() accessor to Kmer type for 2-bit extraction at position i
- Renamed unitig.rs → longtigs, updated CLI command and output filenames to reflect "long t ig"
- Extended extract_kmers() in scripts/compare.py with duplication statistics
```

2026-05-02 16:31:08 +02:00

..

compare_kmers.py

refactor: improve de Bruijn graph traversal and longtig generation

2026-05-02 16:31:08 +02:00

jj_commit_msg.sh

refactor: implement RoutableSuperKmer and update k-mer indexing pipeline

2026-05-01 09:33:26 +02:00

plot_spectrum.py

Refactor: Extract utility function for string reversal

2026-04-30 06:58:46 +02:00