Cargando…
A divide-and-conquer algorithm for large-scale de novo transcriptome assembly through combining small assemblies from existing algorithms
BACKGROUND: While the continued development of high-throughput sequencing has facilitated studies of entire transcriptomes in non-model organisms, the incorporation of an increasing amount of RNA-Seq libraries has made de novo transcriptome assembly difficult. Although algorithms that can assemble a...
Autores principales: | Sze, Sing-Hoi, Parrott, Jonathan J., Tarone, Aaron M. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5731495/ https://www.ncbi.nlm.nih.gov/pubmed/29244008 http://dx.doi.org/10.1186/s12864-017-4270-9 |
Ejemplares similares
-
A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms
por: Sze, Sing-Hoi, et al.
Publicado: (2017) -
A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data
por: Sze, Sing-Hoi, et al.
Publicado: (2014) -
A divide-and-conquer algorithm for quantum state preparation
por: Araujo, Israel F., et al.
Publicado: (2021) -
A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU
por: Mei, Gang, et al.
Publicado: (2018) -
Kart: a divide-and-conquer algorithm for NGS read alignment
por: Lin, Hsin-Nan, et al.
Publicado: (2017)