A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data

BACKGROUND: The recent advance of high-throughput sequencing makes it feasible to study entire transcriptomes through the application of de novo sequence assembly algorithms. While a popular strategy is to first construct an intermediate de Bruijn graph structure to represent the transcriptome, an a...

Descripción completa

Detalles Bibliográficos
Autores principales: Sze, Sing-Hoi, Tarone, Aaron M
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2014
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4120145/
https://www.ncbi.nlm.nih.gov/pubmed/25082000
http://dx.doi.org/10.1186/1471-2164-15-S5-S6

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4120145/
https://www.ncbi.nlm.nih.gov/pubmed/25082000
http://dx.doi.org/10.1186/1471-2164-15-S5-S6

Ejemplares similares