1397 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 R...1397 days ago
parallelLastz: Lastz with multi-threads support.
...rocessors. When the query file format is fasta, you can specify many threads to process it. It can reduce run time linearly, and use almost equal memory as the original lastz program...1353 days ago
GraphUnzip: Phases an assembly graph using Hi-C data and/or long reads.
GraphUnzip, a fast, memory-efficient and accurate tool to unzip assembly graphs into their constituent haplotypes using long reads and/or Hi-C data. As GraphUnzip only connects s...1185 days ago
oGNM:Conformational dynamics based on contact topology in a coarse-grained presentation
...th our theories (2) that guarantee our implementations to be more efficient (saving 3/4 time, assuming equal size of system and environment), more memory friendly (saving >1/2 time...840 days ago
odgi: optimized dynamic genome/graph implementation
...er and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of pack...824 days ago
PuffAligner: a fast, efficient and accurate aligner based on the Pufferfish index
...r to those of Bowtie2, but much more quickly. While exhibiting similar speed to the ultrafast STAR aligner, PuffAligner requires considerably less memory to construct its index and al...746 days ago