Expand description
Create compressed DeBruijn graphs from uncompressed DeBruijn graphs, or a collection of disjoint DeBruijn graphs.
Structs§
- Check
Compress - CompressionSpec with custom check and function
- Scmap
Compress - Extending trait CompressionSpec for compression
- Simple
Compress - Simple implementation of
CompressionSpecthat lets you provide that data reduction function as a closure
Traits§
- Compression
Spec - Customize the path-compression process. Implementing this trait lets the user
control how the per-kmer data (of type
D) is summarized into a per-path summary data (of typeDS). It also let’s the user introduce new breaks into paths by inspecting in the per-kmer data of a proposed withjoin_test_kmerfunction.
Functions§
- compress_
graph - Perform path-compression on a (possibly partially compressed) DeBruijn graph
- compress_
kmers - Take (make) a BoomHash Object and build a compressed DeBruijn graph.
- compress_
kmers_ no_ exts - Build graph from a set of kmers with unknown extensions by finding the extensions on the fly.
- compress_
kmers_ with_ hash - Take a BoomHash Object and build a compressed DeBruijn graph.
- rebuild_
uncompressed_ graph - re-build an uncompressed graph while leaving out nodes
- uncompressed_
graph - build an uncompressed graph from hashed k-mers