A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms

Documenti analoghi

• A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms
  di: Sing-Hoi Sze, et al.
  Pubblicazione: (2017-05-01)
• A divide-and-conquer algorithm for large-scale de novo transcriptome assembly through combining small assemblies from existing algorithms
  di: Sze, Sing-Hoi, et al.
  Pubblicazione: (2017)
• A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data
  di: Sze, Sing-Hoi, et al.
  Pubblicazione: (2014)
• Gene expression correlates of facultative predation in the blow fly Chrysomya rufifacies (Diptera: Calliphoridae)
  di: Pimsler, Meaghan L., et al.
  Pubblicazione: (2019)
• Heuristic pairwise alignment of de Bruijn graphs to facilitate simultaneous transcript discovery in related organisms from RNA-Seq data
  di: Fu, Shuhua, et al.
  Pubblicazione: (2015)