Cargando…
A Family of Tree-Based Generators for Bubbles in Directed Graphs
Bubbles are pairs of internally vertex-disjoint (s, t)-paths in a directed graph. In de Bruijn graphs built from reads of RNA and DNA data, bubbles represent interesting biological events, such as alternative splicing (AS) and allelic differences (SNPs and indels). However, the set of all bubbles in...
Autores principales: | Acuña, Vicente, Lima, Leandro, Italiano, Giuseppe F., Pepè Sciarria, Luca, Sagot, Marie-France, Sinaimeri, Blerina |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254895/ http://dx.doi.org/10.1007/978-3-030-48966-3_2 |
Ejemplares similares
-
EUCALYPT: efficient tree reconciliation enumerator
por: Donati, Beatrice, et al.
Publicado: (2015) -
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs
por: Sacomoto, Gustavo, et al.
Publicado: (2015) -
Efficiently sparse listing of classes of optimal cophylogeny reconciliations
por: Wang, Yishu, et al.
Publicado: (2022) -
Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility
por: Calamoneri, Tiziana, et al.
Publicado: (2020) -
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)