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

Autor: Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri, Vicente Acuña

Publikováno v: Combinatorial Algorithms
IWOCA 2020-31st International Workshop on Combinatorial Algorithms
IWOCA 2020-31st International Workshop on Combinatorial Algorithms, Jun 2020, Bordeaux, France. pp.17-29, ⟨10.1007/978-3-030-48966-3_2⟩
Journal of Graph Algorithms and Applications
Journal of Graph Algorithms and Applications, 2021, 25 (1), pp.549-562. ⟨10.7155/jgaa.00572⟩
Journal of Graph Algorithms and Applications, Brown University, 2021, 25 (1), pp.549-562. ⟨10.7155/jgaa.00571⟩
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA

International audience; 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

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d9e2dfc9e580c318ce416bc3b301441
http://europepmc.org/articles/PMC7254895