A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithms for Molecular Biology Year : 2015

A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs

Abstract

Background: The problem of enumerating bubbles with length constraints in directed graphs arises in transcrip‑ tomics where the question is to identify all alternative splicing events present in a sample of mRNAs sequenced by RNA‑seq. Results: We present a new algorithm for enumerating bubbles with length constraints in weighted directed graphs. This is the first polynomial delay algorithm for this problem and we show that in practice, it is faster than previous approaches. Conclusion: This settles one of the main open questions from Sacomoto et al. (BMC Bioinform 13:5, 2012). Moreover, the new algorithm allows us to deal with larger instances and possibly detect longer alternative splicing events.
Fichier principal
Vignette du fichier
Sacomoto2015.pdf (1.58 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01170399 , version 1 (20-10-2015)

Identifiers

Cite

Gustavo Sacomoto, Vincent Lacroix, Marie‑france Sagot. A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs. Algorithms for Molecular Biology, 2015, pp.10. ⟨10.1186/s13015-015-0046-4⟩. ⟨hal-01170399⟩
152 View
176 Download

Altmetric

Share

Gmail Facebook X LinkedIn More