From indexing data structures to de Bruijn graphs
From MaRDI portal
Recommendations
Cited in
(18)- Graph algorithms for DNA sequencing -- origins, current models and the future
- A tale of optimizing the space taken by de Bruijn graphs
- MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly
- Linking indexing data structures to de Bruijn graphs: construction and update
- Construction of a de Bruijn graph for assembly from a truncated suffix tree
- Bidirectional variable-order de Bruijn graphs
- Superstring graph: a new approach for genome assembly
- Efficient construction of a compressed de Bruijn graph for pan-genome analysis
- Full-text indexes for high-throughput sequencing
- Next generation sequencing under de novo genome assembly
- Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
- Succinct de Bruijn graphs
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- Simulating the DNA overlap graph in succinct space
- Haplotype-aware graph indexes
- Synteny paths for assembly graphs comparison
- Disentangled long-read de Bruijn graphs via optical maps
- An index for sequencing reads based on the colored de Bruijn graph
This page was built for publication: From indexing data structures to de Bruijn graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165595)