Superbubbles, Ultrabubbles, and Cacti
Open accessPublished version of a preprint
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
A superbubble is a type of directed acyclic subgraph with single distinct source and sink vertices. In genome assembly and genetics, the possible paths through a superbubble can be considered to represent the set of possible sequences at a location in a genome. Bidirected and biedged graphs are a generalization of digraphs that are increasingly being used to more fully represent genome assembly and variation problems. In this study, we define snarls and ultrabubbles, generalizations of superbubbles for bidirected and biedged graphs, and give an efficient algorithm for the detection of these more general structures. Key to this algorithm is the cactus graph, which, we show, encodes the nested decomposition of a graph into snarls and ultrabubbles within its structure. We propose and demonstrate empirically that this decomposition on bidirected and biedged graphs solves a fundamental problem by defining genetic sites for any collection of genomic variations, including complex structural variations, without need for any single reference genome coordinate system. Further, the nesting of the decomposition gives a natural way to describe and model variations contained within large variations, a case not currently dealt with by existing formats [e.g., variant cell format (VCF)].
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
An Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
The fragment assembly string graph
Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1114 · Cited by 424 · cited 1×
“…especially prominent for sequence representation, in particular the de Bruijn graph (de Bruijn, 1946; Pevzner et al., 2001), the string graph (Myers, 2005), the breakpoint graph (Pevzner, 2000; Alekseyev and Pevzner, 2009), and the bidirected graph (aka sequence graph; Edmonds and Johnson,…”
Cactus Graphs for Genome Comparisons
Paten, B., Diekhans, M., Earl, D., John, J. S., Ma, J., Suh, B., & Haussler, D. (2011) · Journal of Computational Biology · doi:10.1089/cmb.2010.0252 · Cited by 102
Self-citation
Research works printed but not linked: 14
- 10.1038/nature15393 · DOI · Paper page
- 10.1101/gr.082784.108 · DOI
- 10.1007/978-3-642-34109-0_13 · doi:10.1007/978-3-642-34109-0_13
- 10.1016/j.tcs.2015.10.021 · DOI
- de Bruijn N.G., 1946, Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam, 49, 758
- EdmondsJ., and JohnsonE.L. 1970. Matching: A Well-Solved Class of Integer Linear Programs, 27–30. Springer: Berlin, Heidelberg. · DOI
- 10.1073/pnas.39.4.315 · DOI
- IliopoulosC.S., KunduR., MohamedM., et al. 2016. Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis, 3–14. Springer International Publishing, Cham. · DOI
- 10.1089/cmb.2009.0047 · DOI · Paper page
- 10.1007/978-3-642-40453-5_26 · DOI · Paper page
- Pevzner P., 2000, Computational Molecular Biology: An Algorithmic Approach, 10.7551/mitpress/2022.001.0001 · DOI · Paper page
- 10.1007/978-3-319-58163-7_2 · doi:10.1007/978-3-319-58163-7_2
- 10.1109/TCBB.2014.2385696 · DOI
- 10.1101/gr.074492.107 · DOI · Paper page
Cited by
A draft human pangenome reference.
Liao, W.-W., Asri, M., Ebler, J., Doerr, D., Haukness, M., Hickey, G., Lu, S., Lucas, J. K., Monlong, J., Abel, H. J., et al. (2023) · Nature · doi:10.1038/s41586-023-05896-x · Cited by 1,129
“These snarls were then converted to VCF format using vg deconstruct (Paten et al., 2018).”
MethodInfluentialSelf-citationmetaFlye: scalable long-read metagenome assembly using repeat graphs
Kolmogorov, M., Bickhart, D. M., Behsaz, B., Gurevich, A., Rayko, M., Shin, S. B., Kuhn, K., Yuan, J., Polevikov, E., Smith, T. P. L., et al. (2020) · Nature Methods · doi:10.1038/s41592-020-00971-x · Cited by 1,077
Progressive Cactus is a multiple-genome aligner for the thousand-genome era
Armstrong, J., Hickey, G., Diekhans, M., Fiddes, I. T., Novak, A. M., Deran, A., Fang, Q., Xie, D., Feng, S., Stiller, J., et al. (2020) · Nature · doi:10.1038/s41586-020-2871-y · Cited by 586
Self-citationGenome graphs and the evolution of genome inference
Paten, B., Novak, A. M., Eizenga, J. M., & Garrison, E. (2017) · Genome Research · doi:10.1101/gr.214155.116 · Cited by 351
Self-citationPangenomics enables genotyping of known structural variants in 5202 diverse genomes
Sirén, J., Monlong, J., Chang, X., Novak, A. M., Eizenga, J. M., Markello, C., Sibbesen, J. A., Hickey, G., Chang, P.-C., Carroll, A., et al. (2021) · Science · doi:10.1126/science.abg8871 · Cited by 400
“We collected basic statistics about the yeast graph and decomposed the graph for analysis using the method of ( 27 ).”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Paten, B., Eizenga, J. M., Rosen, Y. M., Novak, A. M., Garrison, E., & Hickey, G.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 2018-07
- Volume
- 25
- Issue
- 7
- Pages
- 649-663
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2788099780
- Cited by
- 75
- References
- 3
- FWCI
- 2.43
- Type
- journal article
- Language
- en
- Open access
- green
- Licence
- www.liebertpub.com/nv/resources-tools/text-and-data-mining-policy/121/ (tdm)
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: Superbubbles, Ultrabubbles, and Cacti. https://app.cochat.ai/papers/10.1089/cmb.2017.0251
- The paper
- Paten, B., Eizenga, J. M., Rosen, Y. M., Novak, A. M., Garrison, E., & Hickey, G. (2018). Superbubbles, Ultrabubbles, and Cacti. Journal of Computational Biology. https://doi.org/10.1089/cmb.2017.0251
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.