A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data

Résumé

We present a new algorithm for enumerating bubbles with length constraints in directed graphs. This problem arises in transcriptomics, where the question is to identify all alternative splicing events present in a sample of mRNAs sequenced by RNA-seq. This is the fi rst polynomial-delay algorithm for this problem and we show that in practice, it is faster than previous approaches. This enables us to deal with larger instances and therefore to discover novel alternative splicing events, especially long ones, that were previously overseen using existing methods.
Fichier non déposé

Dates et versions

hal-00842982 , version 1 (10-07-2013)

Identifiants

  • HAL Id : hal-00842982 , version 1

Citer

Gustavo Akio Tominaga Sacomoto, Vincent Lacroix, Marie-France Sagot. A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data. Workshop on Algorithms in Bioinformatics (WABI), Sep 2013, Nice, France. ⟨hal-00842982⟩
149 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More