Bidirectional variable-order de Bruijn graphs
From MaRDI portal
Recommendations
Cited in
(20)- Bloom filter trie -- a data structure for pan-genome storage
- Representation of \(k\)-mer sets using spectrum-preserving string sets
- Edge minimization in de Bruijn graphs
- Computing the multi-string BWT and LCP array in external memory
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- External memory BWT and LCP computation for sequence collections with applications
- Wheeler graphs: a framework for BWT-based data structures
- Indexing variation graphs
- Bidirectional Variable-Order de Bruijn Graphs
- Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
- Succinct de Bruijn graphs
- Construction of a de Bruijn graph for assembly from a truncated suffix tree
- Haplotype-aware graph indexes
- From indexing data structures to de Bruijn graphs
- Fixed block compression boosting in FM-indexes: theory and practice
- Space-efficient merging of succinct de Bruijn graphs
- Superbubbles, ultrabubbles and cacti
- From de Bruijn graphs to variation graphs -- relationships between pangenome models
- Linking indexing data structures to de Bruijn graphs: construction and update
- Rainbowfish: a succinct colored de Bruijn graph representation
This page was built for publication: Bidirectional variable-order de Bruijn graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802936)