Skip to Main content Skip to Navigation
Conference papers

A Family of Tree-Based Generators for Bubbles in Directed Graphs

Abstract : Bubbles are pairs of internally vertex-disjoint (s, t)-paths in a directed graph. In de Bruijn graphs built from reads of RNA and DNA data, bubbles represent interesting biological events, such as alternative splicing (AS) and allelic differences (SNPs and indels). However, the set of all bubbles in a de Bruijn graph built from real data is usually too large to be efficiently enumerated and analysed in practice. In particular, despite significant research done in this area, listing bubbles still remains the main bottleneck for tools that detect AS events in a reference-free context. Recently, in [1] the concept of a bubble generator was introduced as a way for obtaining a compact representation of the bubble space of a graph. Although this generator was quite effective in finding AS events, preliminary experiments showed that it is about 5 times slower than state-of-art methods. In this paper we propose a new family of bubble generators which improve substantially on the previous generator: generators in this new family are about two orders of magnitude faster and are still able to achieve similar precision in identifying AS events. To highlight the practical value of our new generators, we also report some experimental results on a real dataset.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Monday, October 19, 2020 - 11:48:35 AM
Last modification on : Tuesday, May 17, 2022 - 2:50:02 PM
Long-term archiving on: : Wednesday, January 20, 2021 - 6:34:05 PM


Files produced by the author(s)




Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F Italiano, Luca Pepè Sciarria, Marie-France Sagot, et al.. A Family of Tree-Based Generators for Bubbles in Directed Graphs. IWOCA 2020 - 31st International Workshop on Combinatorial Algorithms, Jun 2020, Bordeaux, France. pp.17-29, ⟨10.1007/978-3-030-48966-3_2⟩. ⟨hal-02971154⟩



Record views


Files downloads