Introduce new hashing mechanisms and support for directional unitig checks. Fix fragmentation issues and improve performance metrics through optimized graph construction and new benchmarking utilities.
22 lines
604 B
Rust
22 lines
604 B
Rust
//! De Bruijn graph over canonical k-mers, built for unitig extraction.
|
|
//!
|
|
//! Submodules: [`kmer_hash`] (hasher of the node table), [`node`] (packed per-kmer neighbour/visited/start flags),
|
|
//! [`walk`] (single-step traversal), [`graph`] ([`GraphDeBruijn`] itself),
|
|
//! [`unitig_iter`] (nucleotide-by-nucleotide unitig walk iterator).
|
|
|
|
mod graph;
|
|
mod kmer_hash;
|
|
mod node;
|
|
mod unitig_iter;
|
|
mod walk;
|
|
|
|
pub use graph::GraphDeBruijn;
|
|
|
|
// Only used by `tests/debruijn.rs` (`use super::*`) below.
|
|
#[cfg(test)]
|
|
use obikseq::{CanonicalKmer, Sequence};
|
|
|
|
#[cfg(test)]
|
|
#[path = "../tests/debruijn.rs"]
|
|
mod tests;
|