Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 5,307

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler

Open access
Luo, Ruibang, Liu, Binghang, Xie, Yinlong, Li, Zhenyu, Huang, Weihua, Yuan, Jianying, He, Guangzhu, Chen, Yanxiang, Pan, Qi, Liu, Yunjie, Tang, Jingbo, Wu, Gengxiong, Zhang, Hao, Shi, Yujian, Liu, Yong, Yu, Chang, Wang, Bo, Lu, Yao, Han, Changlei, Cheung, David W, Yiu, Siu-Ming, Peng, Shaoliang, Xiaoqian, Zhu, Liu, Guangming, Liao, Xiangke, Li, Yingrui, Yang, Huanming, Wang, Jian, Lam, Tak-Wah, Wang, Jun·2012·Gigascience

Abstract

Background: There is a rapidly increasing amount of de novo genome assembly using next-generation sequencing (NGS) short reads; however, several big challenges remain to be overcome in order for this to be efficient and accurate. SOAPdenovo has been successfully applied to assemble many published genomes, but it still needs improvement in continuity, accuracy and coverage, especially in repeat regions. Findings: To overcome these challenges, we have developed its successor, SOAPdenovo2, which has the advantage of a new algorithm design that reduces memory consumption in graph construction, resolves more repeat regions in contig assembly, increases coverage and length in scaffold construction, improves gap closing, and optimizes for large genome. Conclusions: Benchmark using the Assemblathon1 and GAGE datasets showed that SOAPdenovo2 greatly surpasses its predecessor SOAPdenovo and is competitive to other assemblers on both assembly length and accuracy. We also provide an updated assembly version of the 2008 Asian (YH) genome using SOAPdenovo2. Here, the contig and scaffold N50 of the YH genome were ~20.9 kbp and ~22 Mbp, respectively, which is 3-fold and 50-fold longer than the first published version. The genome coverage increased from 81.16% to 93.91%, and memory consumption was ~2/3 lower during the point of largest memory consumption.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1186/2047-217x-1-18

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • De novo assembly of human genomes with massively parallel short read sequencing

    Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K., et al. (2010) · Genome Research · doi:10.1101/gr.097261.109 · Cited by 2,926 · cited 4×

    “The previous assembly was done using SOAPdenovo1 [3], but in addition it was also limited by the very short read lengths (~35 bp) that were the standard output of Illumina Genome Analyzers (GAIIx) at that time and by the insert sizes available (maximum size is 10 kb).”
    BackgroundMethodInfluentialSelf-citation
  • The diploid genome sequence of an Asian individual

    Wang, J., Wang, W., Li, R., Li, Y., Tian, G., Goodman, L., Fan, W., Zhang, J., Li, J., Zhang, J., et al. (2008) · Nature · doi:10.1038/nature07484 · Cited by 924 · cited 1×

    “We also used SOAPdenovo2 to reassemble and update the previously assembled YH Asian Genome [12].”
    MethodSelf-citation

Show all 2 references

Research works printed but not linked: 15

  1. Earl, 2011, Assemblathon 1: a competitive assessment of de novo short read assembly methods, Genome Res, 21, 2224, 10.1101/gr.126599.111 · DOI · Paper page
  2. Salzberg, 2012, GAGE: a critical evaluation of genome assemblies and assembly algorithms, Genome Res, 22, 557, 10.1101/gr.131383.111 · DOI · Paper page
  3. Alkan, 2011, Limitations of next-generation genome sequence assembly, Nat Methods, 8, 61, 10.1038/nmeth.1527 · DOI · Paper page
  4. Gnerre, 2011, High-quality draft assemblies of mammalian genomes from massively parallel sequence data, Proc Natl Acad Sci U S A, 108, 1513, 10.1073/pnas.1017351108 · DOI · Paper page
  5. Wang, 2011, Genome sequence of YH: the first diploid genome sequence of a Han Chinese individual
  6. Zerbino, 2008, Velvet: algorithms for de novo short read assembly using de Bruijn graphs, Genome Res, 18, 821, 10.1101/gr.074492.107 · DOI · Paper page
  7. Ye, 2012, Exploiting sparseness in de novo genome assembly, BMC Bioinformatics, 13 Suppl 6, S1, 10.1186/1471-2105-13-S6-S1 · DOI · Paper page
  8. Peng, 2012, IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth, Bioinformatics, 28, 1420, 10.1093/bioinformatics/bts174 · DOI · Paper page
  9. Dayarian, 2010, SOPRA: scaffolding algorithm for paired reads via statistical optimization, BMC Bioinformatics, 11, 345, 10.1186/1471-2105-11-345 · DOI
  10. The Assemblathon.
  11. Wang J, Li Y, Luo R, Liu B, Xie Y, Li Z, Fang X, Zheng H, Qin J, Yang B, Yu C, Ni P, Li N, Guo G, Ye J, Fang L, Su Y, Asan , Zheng H, Kristiansen K, Wong GK, Nielsen R, Durbin R, Bolund L, Zhang X, Li S, Yang H, Wang J. 2012, Updated genome assembly of YH: the first diploid genome sequence of a Han Chinese individual (version 2, 07/2012), GigaScience Database, 10.5524/100038. · doi:10.5524/100038
  12. The UCSC Genome Bioinformatics site.
  13. She, 2004, Shotgun sequence assembly and recent segmental duplications within the human genome, Nature, 431, 927, 10.1038/nature03062 · DOI · Paper page
  14. Yan Huang - The first Asian diploid genome.
  15. Luo R, Liu B, Xie Y, Li Z, Huang W, Yuan J, He G, Chen Y, Pan Q, Liu Y, Tang J, Wu G, Zhang H, Shi Y, Liu Y, Yu C, Wang B, Lu Y, Han C, Cheung D, Yiu SM, Liu G, Zhu X, Peng S, Li Y, Yang H, Wang J, Lam TW, Wang J. 2012, Software and supporting material for “SOAPdenovo2: an empirically improved memory-efficient short read de novo assembly”, GigaScience Database, 10.5524/100044. · doi:10.5524/100044

Cited by

See all 5,307

Metadata

Authors
Luo, R., Liu, B., Xie, Y., Li, Z., Huang, W., Yuan, J., He, G., Chen, Y., Pan, Q., Liu, Y., Tang, J., Wu, G., Zhang, H., Shi, Y., Liu, Y., Yu, C., Wang, B., Lu, Y., Han, C., Cheung, D. W., Yiu, S.-M., Peng, S., Xiaoqian, Z., Liu, G., Liao, X., Li, Y., Yang, H., Wang, J., Lam, T.-W., & Wang, J.
Venue
Gigascience
Published
2012-12-01
Volume
1
Issue
1
Pages
18-18
ISSN
2047-217X (ISSN-L)
OpenAlex
W2129933858
Cited by
5,307
References
2
FWCI
69.01
Type
journal article
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler. https://app.cochat.ai/papers/10.1186/2047-217x-1-18
The paper
Luo, R., Liu, B., Xie, Y., Li, Z., Huang, W., Yuan, J., He, G., Chen, Y., Pan, Q., Liu, Y., Tang, J., Wu, G., Zhang, H., Shi, Y., Liu, Y., Yu, C., Wang, B., Lu, Y., Han, C., . . . Wang, J. (2012). SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler. Gigascience. https://doi.org/10.1186/2047-217x-1-18

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.