Learn More
de Bruijn graph-based algorithms are one of the two most widely used approaches for de novo genome assembly. A major limitation of this approach is the large computational memory space requirement to construct the de Bruijn graph, which scales with k-mer length and total diversity (N) of unique k-mers in the genome expressed in base pairs or roughly (2k+8)N(More)
There are two major competing explanations for the counter-intuitive presence of bright coloration in certain orb-web spiders. Bright coloration could lure insect prey to the web vicinity, increasing the spider's foraging success. Alternatively, the markings could function as disruptive camouflage, making it difficult for the insect prey to distinguish(More)
Motivation: To tackle the problem of huge memory usage associated with de Bruijn graph-based algorithms, upon which some of the most widely used de novo genome assemblers have been built, we released SparseAssembler1. SparseAssembler1 can save as much as 90% memory consumption in comparison with the state-of-art assemblers, but it requires rounds of(More)
  • 1