TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Motivation: de Bruijn graphs have been proposed as a data structure to facilitate the analysis of related whole genome sequences, in both a population and comparative genomic settings. However, current approaches do not scale well to many genomes of large size (such as mammalian genomes). Results: In this article, we present TwoPaCo, a simple and scalable low memory algorithm for the direct construction of the compacted de Bruijn graph from a set of complete genomes. We demonstrate that it can construct the graph for 100 simulated human genomes in less than a day and eight real primates in < 2 h, on a typical shared-memory machine. We believe that this progress will enable novel biological analyses of hundreds of mammalian-sized genomes. Availability and Implementation: Our code and data is available for download from github.com/medvedevgroup/TwoPaCo. Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The International HapMap Project
†The International HapMap Consortium, Genotyping centres: Baylor College of Medicine and ParAllele BioScience, Gibbs, R. A., Belmont, J. W., Hardenbol, P., Willis, T. D., Yu, F., Chinese HapMap Consortium, Yang, H., Ch'ang, L.-Y., et al. (2003) · Nature · doi:10.1038/nature02168 · Cited by 6,057
Whole-genome analyses resolve early branches in the tree of life of modern birds
Jarvis, E. D., Mirarab, S., Aberer, A. J., Li, B., Houde, P., Li, C., Ho, S. Y. W., Faircloth, B. C., Nabholz, B., Howard, J. T., et al. (2014) · Science · doi:10.1126/science.1253451 · Cited by 1,901 · cited 2×
“With the ubiquity of cheap sequencing, the number of genome sequences available for these studies has expanded tremendously (Haussler et al., 2008; Jarvis et al., 2014; Koepfli et al., 2015).”
BackgroundThe Genome 10K Project: A Way Forward
Koepfli, K.-P., Paten, B., Scientists, T. G. 1. C. O., & O’Brien, S. J. (2015) · Annual Review of Animal Biosciences · doi:10.1146/annurev-animal-090414-014900 · Cited by 311 · cited 1×
“With the ubiquity of cheap sequencing, the number of genome sequences available for these studies has expanded tremendously (Haussler et al., 2008; Jarvis et al., 2014; Koepfli et al., 2015).”
BackgroundAlignathon: a competitive assessment of whole-genome alignment methods
Earl, D., Nguyen, N., Hickey, G., Harris, R. S., Fitzgerald, S., Beal, K., Seledtsov, I., Molodtsov, V., Raney, B. J., Clawson, H., et al. (2014) · Genome Research · doi:10.1101/gr.174920.114 · Cited by 113 · cited 1×
“A competition of whole-genome aligners demonstrated that some recent tools are able to handle larger data sets; however, these were still limited to ≤ 20 genomes of length < 200 Mbp (Earl et al., 2014).”
Cited by
The design and construction of reference pangenome graphs with minigraph
Li, H., Feng, X., & Chu, C. (2020) · Genome Biology · doi:10.1186/s13059-020-02168-z · Cited by 455
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
Garrison, E., Guarracino, A., Heumos, S., Villani, F., Bao, Z., Tattini, L., Hagmann, J., Vorbrugg, S., Marco-Sola, S., Kubica, C., et al. (2024) · Nature Methods · doi:10.1038/s41592-024-02430-3 · Cited by 277
“Meanwhile, although approaches for unbiased pangenome graph construction have been proposed [10, 11], these have been limited to the graph induction step, while experience shows that specialized techniques for pangenome alignment and refinement are required to obtain high-quality pangenome builds [12].”
Garrison, E., & Guarracino, A. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btac743 · Cited by 95
Scalable multiple whole-genome alignment and locally collinear block construction with SibeliaZ
Minkin, I., & Medvedev, P. (2020) · Nature Communications · doi:10.1038/s41467-020-19777-8 · Cited by 77
Self-citation
Metadata
- Authors
- Minkin, I., Pham, S., & Medvedev, P.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2016-09-21
- Volume
- 33
- Issue
- 24
- Pages
- 4024-4032
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2279083700
- Cited by
- 91
- References
- 4
- FWCI
- 3.61
- Type
- journal article
- 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: TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes. https://app.cochat.ai/papers/10.1093/bioinformatics/btw609
- The paper
- Minkin, I., Pham, S., & Medvedev, P. (2017). TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes. Bioinformatics. https://doi.org/10.1093/bioinformatics/btw609
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.