Assembles the very large data sets produced by sequencing individual human genomes. ABySS is a parallelized sequence assembler. The primary innovation in ABySS is a distributed representation of a de Bruijn graph (DBG), which allows parallel computation of the assembly algorithm across a network of commodity computers. The ABySS algorithm proceeds in two stages. First, all possible substrings of length k (termed k-mers) are generated from the sequence reads. The k-mer data set is then processed to remove read errors and initial contigs are built. In the second stage, mate-pair information is used to extend contigs by resolving ambiguities in contig overlaps.