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
S
Description
No description provided
Readme
381 MiB
0 Stars 1 Watchers 0 Forks
v1.4.5
Latest
2026-11-19 06:27:02 +00:00
Languages
HTML 50.8%
Rust 42.2%
Shell 2.2%
Python 2.1%
TeX 1.6%
Other 1%