Cargando…
Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads
BACKGROUND: The main challenge in de novo genome assembly of DNA-seq data is certainly to deal with repeats that are longer than the reads. In de novo transcriptome assembly of RNA-seq reads, on the other hand, this problem has been underestimated so far. Even though we have fewer and shorter repeat...
Autores principales: | Lima, Leandro, Sinaimeri, Blerina, Sacomoto, Gustavo, Lopez-Maestre, Helene, Marchet, Camille, Miele, Vincent, Sagot, Marie-France, Lacroix, Vincent |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5322684/ https://www.ncbi.nlm.nih.gov/pubmed/28250805 http://dx.doi.org/10.1186/s13015-017-0091-2 |
Ejemplares similares
-
KISSPLICE: de-novo calling alternative splicing events from RNA-seq data
por: Sacomoto, Gustavo AT, et al.
Publicado: (2012) -
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) -
EUCALYPT: efficient tree reconciliation enumerator
por: Donati, Beatrice, et al.
Publicado: (2015) -
Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility
por: Calamoneri, Tiziana, et al.
Publicado: (2020)