ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly
With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensiv...Tags: ASplice, scalable, memory-efficient, algorithm, de novo, transcriptome, assembly
2139 days ago
Rainbow: an integrated tool for efficient clustering and assembling RAD-seq reads
Rainbow is developed to provide an ultra-fast and memory-efficient solution to clustering and assembling short reads produced by RAD-seq. First, Rainbow clusters reads using a spaced seed method. Then, Rainbow implements a heterozygote calling like strategy to divide potential groups into haploty...Tags: Rainbow, ultra-fast, memory-efficient, solution, clustering, assembling, short, reads, RAD-seq
2031 days ago
RNA-Bloom: a fast and memory-efficient de novo transcript sequence assembler
RNA-Bloom is a fast and memory-efficient de novo transcript sequence assembler. It is designed for the following sequencing data types: single-end/paired-end bulk RNA-seq (strand-specific/agnostic) paired-end single-cell RNA-seq (strand-specific/agnostic) nanopore RNA-seq (PCR...Tags: RNA-Bloom, fast, memory-efficient, de novo, transcript, sequence, assembler
1402 days ago