Cargando…
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs
BACKGROUND: The problem of enumerating bubbles with length constraints in directed graphs arises in transcriptomics 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 le...
Autores principales: | Sacomoto, Gustavo, Lacroix, Vincent, Sagot, Marie-France |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4483228/ https://www.ncbi.nlm.nih.gov/pubmed/26120359 http://dx.doi.org/10.1186/s13015-015-0046-4 |
Ejemplares similares
-
BubbleGun: enumerating bubbles and superbubbles in genome graphs
por: Dabbaghie, Fawaz, et al.
Publicado: (2022) -
A Family of Tree-Based Generators for Bubbles in Directed Graphs
por: Acuña, Vicente, et al.
Publicado: (2020) -
Analysis and enumeration: algorithms for biological graphs
por: Marino, Andrea
Publicado: (2015) -
KISSPLICE: de-novo calling alternative splicing events from RNA-seq data
por: Sacomoto, Gustavo AT, et al.
Publicado: (2012) -
Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads
por: Lima, Leandro, et al.
Publicado: (2017)