GoldRush: Ade novolong read genome assembler with linear time complexity

Abstract

AbstractMotivationCurrent state-of-the-art long readde novogenome assemblers follow the Overlap Layout Consensus (OLC) paradigm, an O(n2) algorithm in its naïve implementation. While the most time- and memory-intensive step of OLC —the all-vs-all sequencing read alignment process— was improved and reimplemented in modern long read assemblers, these tools still often require excessive computational memory when assembling a typical 50X human genome dataset.ResultsHere we present GoldRush, ade novogenome assembly algorithm with linear time complexity in the number of input long sequencing reads. We tested GoldRush on Oxford Nanopore Technologies datasets with different base error profiles describing the genomes of three human cell lines (NA24385, HG01243 and HG02055),Oryza sativa(rice), andSolanum lycopersicum(tomato). GoldRush achieved NGA50 lengths of 18.3-22.2 Mbp for the three human datasets, with two of the three assemblies having the fewest extensive misassemblies, and NGA50 lengths of 0.3 and 2.6 Mbp for the 373 Mbp and 824 Mbp genomes of rice and tomato, respectively. Further, GoldRush assembled all genomes within a day, using at most 54.5 GB of RAM. These results demonstrate that our algorithm and new assembly paradigm can be used to assemble large genomesde novoefficiently in compute memory space, with resulting assembly contiguity comparable to that of state-of-the-art OLC genome assemblers.Availabilityhttps://github.com/bcgsc/goldrush