hal-00738927, version 1
Efficient Bubble Enumeration in Directed Graphs
Etienne Birmelé 1Pierluigi Crescenzi 2Rui Ferreira 3Roberto Grossi 3Vincent Lacroix a, 4Andrea Marino 2Nadia Pisanti 3Gustavo Sacomoto 4Marie-France Sagot
b, 4
SPIRE (2012) 118-129
Résumé : 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 in this paper the first linear delay algorithm to enumerate all bubbles with a given source.
- a – Université Claude Bernard - Lyon I
- b – INRIA
- 1 : Université d'Evry-Val d'Essonne
- Université d'Evry-Val d'Essonne
- 2 : Université de Florence
- Università degli studi di Firenze
- 3 : Dipartimento di Informatica [Pisa] (DI)
- University of Pisa
- 4 : BAMBOO (LBBE Lyon / INRIA Grenoble Rhône-Alpes)
- Université Claude Bernard - Lyon I – INRIA – CNRS : UMR5558 – Laboratoire de Biométrie et Biologie Evolutive
- Domaine : Informatique/Bio-informatique
Sciences du Vivant/Bio-Informatique, Biologie Systémique
Informatique/Algorithme et structure de données
- hal-00738927, version 1
- http://hal.inria.fr/hal-00738927
- oai:hal.inria.fr:hal-00738927
- Contributeur : Marie-France Sagot
- Soumis le : Vendredi 5 Octobre 2012, 13:54:03
- Dernière modification le : Mardi 11 Décembre 2012, 07:28:18






Documents associés
Exporter