title: Efficient de novo assembly of large genomes using compressed data structures.
abstract: De novo genome sequence assembly is important both to generate new sequence assemblies for previously uncharacterized genomes and to identify the genome sequence of individuals in a reference-unbiased way. We present memory efficient data structures and algorithms for assembly using the FM-index derived from the compressed Burrows-Wheeler transform, and a new assembler based on these called SGA (String Graph Assembler). We describe algorithms to error-correct, assemble, and scaffold large sets of sequence data. SGA uses the overlap-based string graph model of assembly, unlike most de novo assemblers that rely on de Bruijn graphs, and is simply parallelizable. We demonstrate the error correction and assembly performance of SGA on 1.2 billion sequence reads from a human genome, which we are able to assemble using 54 GB of memory. The resulting contigs are highly accurate and contiguous, while covering 95% of the reference genome (excluding contigs <200 bp in length). Because of the low memory requirements and parallelization without requiring inter-process communication, SGA provides the first practical assembler to our knowledge for a mammalian-sized genome on a low-end computing cluster.
authors.affiliation: Wellcome Trust Sanger Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, United Kingdom.
authors.forename: Jared T
authors.initials: JT
authors.lastname: Simpson
authors.forename: Richard
authors.initials: R
authors.lastname: Durbin
mesh_terms: D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods; D044962:Data Compression; D023281:Genomics / Q000379:methods*; D006801:Humans; D020407:Internet; D015203:Reproducibility of Results; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software