Cargando…
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...
Autores principales: | Sze, Sing-Hoi, Tarone, Aaron M |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
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 |
Ejemplares similares
-
Heuristic pairwise alignment of de Bruijn graphs to facilitate simultaneous transcript discovery in related organisms from RNA-Seq data
por: Fu, Shuhua, et al.
Publicado: (2015) -
Identifying similar transcripts in a related organism from de Bruijn graphs of RNA-Seq data, with applications to the study of salt and waterlogging tolerance in Melilotus
por: Fu, Shuhua, et al.
Publicado: (2019) -
Read mapping on de Bruijn graphs
por: Limasset, Antoine, et al.
Publicado: (2016) -
De novo assembly and genotyping of variants using colored de Bruijn graphs
por: Iqbal, Zamin, et al.
Publicado: (2012) -
What is the difference between the breakpoint graph and the de Bruijn graph?
por: Lin, Yu, et al.
Publicado: (2014)