Implements an algorithm for whole genome assembly of deep paired-end short reads. Meraculous relies on an efficient and conservative traversal of a subgraph of the k-mer de Bruijn graph (DBG) of oligonucleotides with unique high quality extensions in the dataset. Unlike other short-read assemblers, Meraculous avoids an explicit error correction step, instead relying on base quality scores. Meraculous also incorporates a low-memory hash structure to access the DBG, allowing a small memory footprint compared with other short-read assemblers. Using Meraculous, it was shown that high quality, near-complete de novo assemblies of small fungal genomes can be produced using deep short-read paired-end datasets.