CoChat

Superbubbles, Ultrabubbles, and Cacti

Open access
Paten, Benedict, Eizenga, Jordan M., Rosen, Yohei M., Novak, Adam M., Garrison, Erik, Hickey, Glenn · 2018 · Journal of Computational Biology

Published version of a preprint

Cited by 75

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1089/cmb.2017.0251

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Research works printed but not linked: 14

  1. 10.1038/nature15393 · DOI · Paper page
  2. 10.1101/gr.082784.108 · DOI
  3. 10.1007/978-3-642-34109-0_13 · doi:10.1007/978-3-642-34109-0_13
  4. 10.1016/j.tcs.2015.10.021 · DOI
  5. de Bruijn N.G., 1946, Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam, 49, 758
  6. EdmondsJ., and JohnsonE.L. 1970. Matching: A Well-Solved Class of Integer Linear Programs, 27–30. Springer: Berlin, Heidelberg. · DOI
  7. 10.1073/pnas.39.4.315 · DOI
  8. 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
  9. 10.1089/cmb.2009.0047 · DOI · Paper page
  10. 10.1007/978-3-642-40453-5_26 · DOI · Paper page
  11. Pevzner P., 2000, Computational Molecular Biology: An Algorithmic Approach, 10.7551/mitpress/2022.001.0001 · DOI · Paper page
  12. 10.1007/978-3-319-58163-7_2 · doi:10.1007/978-3-319-58163-7_2
  13. 10.1109/TCBB.2014.2385696 · DOI
  14. 10.1101/gr.074492.107 · DOI · Paper page

Cited by

See all 75

Metadata

Authors
Paten, B., Eizenga, J. M., Rosen, Y. M., Novak, A. M., Garrison, E., & Hickey, G.
Venue
Journal of Computational Biology
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.