SPAdes is a new genome assembly algorithm that improves upon existing assemblers for both single-cell and standard (multicell) data. It addresses challenges in single-cell sequencing, including non-uniform read coverage, sequencing errors, and chimeric reads. SPAdes uses a multisized de Bruijn graph and paired assembly graphs to enhance accuracy and efficiency. It introduces k-bimer adjustment to estimate distances between k-mers and utilizes paired assembly graphs to handle read-pairs effectively. SPAdes is available as open-source software and has been benchmarked against other assemblers on single-cell and cultured E. coli datasets. It provides more accurate genome assemblies for uncultivated bacteria compared to traditional metagenomics approaches. The algorithm uses graph topology, coverage, and sequence lengths to construct assemblies, and it includes a universal assembler framework that can be applied to various applications involving de Bruijn graphs. SPAdes improves on existing assemblers by incorporating error correction, bulge correction, and efficient graph simplification techniques. It is designed to handle the unique challenges of single-cell sequencing, including variable insert sizes and chimeric reads, and it provides more accurate and reliable genome assemblies.SPAdes is a new genome assembly algorithm that improves upon existing assemblers for both single-cell and standard (multicell) data. It addresses challenges in single-cell sequencing, including non-uniform read coverage, sequencing errors, and chimeric reads. SPAdes uses a multisized de Bruijn graph and paired assembly graphs to enhance accuracy and efficiency. It introduces k-bimer adjustment to estimate distances between k-mers and utilizes paired assembly graphs to handle read-pairs effectively. SPAdes is available as open-source software and has been benchmarked against other assemblers on single-cell and cultured E. coli datasets. It provides more accurate genome assemblies for uncultivated bacteria compared to traditional metagenomics approaches. The algorithm uses graph topology, coverage, and sequence lengths to construct assemblies, and it includes a universal assembler framework that can be applied to various applications involving de Bruijn graphs. SPAdes improves on existing assemblers by incorporating error correction, bulge correction, and efficient graph simplification techniques. It is designed to handle the unique challenges of single-cell sequencing, including variable insert sizes and chimeric reads, and it provides more accurate and reliable genome assemblies.