The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Succinct de Bruijn Graphs
Open accessAbstract
We propose a new succinct de Bruijn graph representation. If the de Bruijn graph of k-mers in a DNA sequence of length N has m edges, it can be represented in 4m+o(m) bits. This is much smaller than existing ones. The numbers of outgoing and incoming edges of a node are computed in constant time, and the outgoing and incoming edge with given label are found in constant time and $\mathcal{O}(k)$ time, respectively. The data structure is constructed in $\mathcal{O}(Nk \log m/\log\log m)$ time using no additional space.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
De novo assembly of human genomes with massively parallel short read sequencing
Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K., et al. (2010) · Genome Research · doi:10.1101/gr.097261.109 · Cited by 2,926 · cited 3×
“Most modern assembler programs use this paradigm [12, 13, 14, 15, 16, 17, 18, 19].”
BackgroundMethodThe Human Genome Project: Lessons from Large-Scale Biology
Collins, F. S., Morgan, M., & Patrinos, A. (2003) · Science · doi:10.1126/science.1084564 · Cited by 1,284
How to apply de Bruijn graphs to genome assembly
Compeau, P. E. C., Pevzner, P. A., & Tesler, G. (2011) · Nature Biotechnology · doi:10.1038/nbt.2023 · Cited by 673
Cited by
Eizenga, J. M., Novak, A. M., Sibbesen, J. A., Heumos, S., Ghaffaari, A., Hickey, G., Chang, X., Seaman, J. D., Rounthwaite, R., Ebler, J., et al. (2020) · Annual Review of Genomics and Human Genetics · doi:10.1146/annurev-genom-120219-080406 · Cited by 320
Indexing Graphs for Path Queries with Applications in Genome Research
Siren, J., Valimaki, N., & Makinen, V. (2014) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2013.2297101 · Cited by 324
A Review of bioinformatics tools for bio-prospecting from metagenomic sequence data
Roumpeka, D. D., Wallace, R. J., Escalettes, F., Fotheringham, I., & Watson, M. (2017) · Frontiers in Genetics · doi:10.3389/fgene.2017.00023 · Cited by 199
“Megahit (Li et al., 2015) uses a very similar approach to IDBA-UD, but takes advantage of succinct de Bruijn graphs (Bowe et al., 2012) and GPUs, which lowers the memory requirements and increases speed, respectively.”
MethodScalable pairwise whole-genome homology mapping of long genomes with BubbZ
Minkin, I., & Medvedev, P. (2020) · iScience · doi:10.1016/j.isci.2020.101224 · Cited by 15
Farruggia, A., Gagie, T., Navarro, G., Puglisi, S. J., & Sirén, J. (2018) · The Computer Journal · doi:10.1093/comjnl/bxx108 · Cited by 14
Metadata
- Authors
- Bowe, A., Onodera, T., Sadakane, K., & Shibuya, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 225-235
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W6247929
- Cited by
- 167
- References
- 3
- FWCI
- 6.40
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Succinct de Bruijn Graphs. https://app.cochat.ai/papers/10.1007/978-3-642-33122-0_18
- The paper
- Bowe, A., Onodera, T., Sadakane, K., & Shibuya, T. (2012). Succinct de Bruijn Graphs. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-33122-0_18
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
