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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01170399
Contributor : Marie-France Sagot <>
Submitted on : Tuesday, October 20, 2015 - 2:26:22 PM
Last modification on : Thursday, November 21, 2019 - 1:14:05 PM
Long-term archiving on : Thursday, January 21, 2016 - 10:17:20 AM

File

Sacomoto2015.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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, BioMed Central, 2015, pp.10. ⟨10.1186/s13015-015-0046-4⟩. ⟨hal-01170399⟩

Share

Metrics

Record views

331

Files downloads

948