Abstract
Polymorphisms in DNA- or RNA-seq data lead to recognisable patterns in a de Bruijn graph representation of the reads obtained by sequencing. Such patterns have been called mouths, or bubbles in the literature. They correspond to two vertex-disjoint directed paths between a source \(s\) and a target \(t\). Due to the high number of such bubbles that may be present in real data, their enumeration is a major issue concerning the efficiency of dedicated algorithms. We propose the first linear delay algorithm to enumerate all bubbles with a given source, by properly transforming the graph in input and enumerating special cycles.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The only twin-free cycles in of size four in \(G'_s\) are generated by the outgoing arcs of \(s\). There are \(O(|V|)\) of such cycles.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Atlantis Press and the authors
About this chapter
Cite this chapter
Marino, A. (2015). Enumerating Bubbles: Listing Pairs of Vertex Disjoint Paths. In: Analysis and Enumeration. Atlantis Studies in Computing, vol 6. Atlantis Press, Paris. https://doi.org/10.2991/978-94-6239-097-3_5
Download citation
DOI: https://doi.org/10.2991/978-94-6239-097-3_5
Published:
Publisher Name: Atlantis Press, Paris
Print ISBN: 978-94-6239-096-6
Online ISBN: 978-94-6239-097-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)