Keywords
De Bruijn graphBloom filterDe Bruijn sequenceComputer scienceGraphData structureFalse positive paradoxEnumerationTheoretical computer scienceComputational biologyBiologyAlgorithmMathematicsDiscrete mathematicsArtificial intelligenceProgramming language
Affiliated Institutions
Related Publications
A parallel graph decomposition algorithm for DNA sequencing with nanopores
Abstract Motivation: With the potential availability of nanopore devices that can sense the bases of translocating single-stranded DNA (ssDNA), it is likely that ‘reads’ of leng...
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
We have developed a new set of algorithms, collectively called “Velvet,” to manipulate de Bruijn graphs for genomic sequence assembly. A de Bruijn graph is a compact representat...
The fragment assembly string graph
Abstract We present a concept and formalism, the string graph, which represents all that is inferable about a DNA sequence from a collection of shotgun sequencing reads collecte...
Colored de Bruijn Graphs and the Genome Halving Problem
Breakpoint graph analysis is a key algorithmic technique in studies of genome rearrangements. However, breakpoint graphs are defined only for genomes without duplicated genes, t...
IDBA-UD: a <i>de novo</i> assembler for single-cell and metagenomic sequencing data with highly uneven depth
Abstract Motivation: Next-generation sequencing allows us to sequence reads from a microbial environment using single-cell sequencing or metagenomic sequencing technologies. How...
Publication Info
- Year
- 2012
- Type
- book-chapter
- Pages
- 236-248
- Citations
- 71
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
71
OpenAlex
Cite This
Rayan Chikhi,
Guillaume Rizk
(2012).
Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter.
Lecture notes in computer science
, 236-248.
https://doi.org/10.1007/978-3-642-33122-0_19
Identifiers
- DOI
- 10.1007/978-3-642-33122-0_19