The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth
Open accessAbstract
Motivation: Next-generation sequencing allows us to sequence reads from a microbial environment using single-cell sequencing or metagenomic sequencing technologies. However, both technologies suffer from the problem that sequencing depth of different regions of a genome or genomes from different species are highly uneven. Most existing genome assemblers usually have an assumption that sequencing depths are even. These assemblers fail to construct correct long contigs. Results: We introduce the IDBA-UD algorithm that is based on the de Bruijn graph approach for assembling reads from single-cell sequencing or metagenomic sequencing technologies with uneven sequencing depths. Several non-trivial techniques have been employed to tackle the problems. Instead of using a simple threshold, we use multiple depthrelative thresholds to remove erroneous k-mers in both low-depth and high-depth regions. The technique of local assembly with paired-end information is used to solve the branch problem of low-depth short repeat regions. To speed up the process, an error correction step is conducted to correct reads of high-depth regions that can be aligned to highconfident contigs. Comparison of the performances of IDBA-UD and existing assemblers (Velvet, Velvet-SC, SOAPdenovo and Meta-IDBA) for different datasets, shows that IDBA-UD can reconstruct longer contigs with higher accuracy. Availability: The IDBA-UD toolkit is available at our website http://www.cs.hku.hk/~alse/idba_ud Contact: chin@cs.hku.hk
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.
Integrity signals
Registry
Cites
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.
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
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
Zerbino, D. R., & Birney, E. (2008) · Genome Research · doi:10.1101/gr.074492.107 · Cited by 9,491
<tt>BLAT</tt> —The <tt>BLAST</tt> -Like Alignment Tool
Kent, W. J. (2002) · Genome Research · doi:10.1101/gr.229202 · Cited by 8,480
ABySS: A parallel assembler for short read sequence data
Simpson, J. T., Wong, K., Jackman, S. D., Schein, J. E., Jones, S. J. M., & Birol, İ. (2009) · Genome Research · doi:10.1101/gr.089532.108 · Cited by 3,608
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 2×
“To speed up the process, an error correction step is conducted to correct reads of high-depth regions that can be aligned to highconfident contigs.”
MethodAn Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
ALLPATHS: De novo assembly of whole-genome shotgun microreads
Butler, J., MacCallum, I., Kleber, M., Shlyakhter, I. A., Belmonte, M. K., Lander, E. S., Nusbaum, C., & Jaffe, D. B. (2008) · Genome Research · doi:10.1101/gr.7337908 · Cited by 808
Wooley, J. C., Godzik, A., & Friedberg, I. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000667 · Cited by 688
Noguchi, H., Taniguchi, T., & Itoh, T. (2008) · DNA Research · doi:10.1093/dnares/dsn027 · Cited by 653
De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer
Hernandez, D., François, P., Farinelli, L., Østerås, M., & Schrenzel, J. (2008) · Genome Research · doi:10.1101/gr.072033.107 · Cited by 629
Quake: quality-aware detection and correction of sequencing errors
Kelley, D. R., Schatz, M. C., & Salzberg, S. L. (2010) · Genome Biology · doi:10.1186/gb-2010-11-11-r116 · Cited by 582
Assemblathon 1: A competitive assessment of de novo short read assembly methods
Earl, D., Bradnam, K., St. John, J., Darling, A., Lin, D., Fass, J., Yu, H. O. K., Buffalo, V., Zerbino, D. R., Diekhans, M., et al. (2011) · Genome Research · doi:10.1101/gr.126599.111 · Cited by 507
Short read fragment assembly of bacterial genomes
Chaisson, M. J., & Pevzner, P. A. (2008) · Genome Research · doi:10.1101/gr.7088808 · Cited by 441
Assembling the Marine Metagenome, One Cell at a Time
Woyke, T., Xie, G., Copeland, A., González, J. M., Han, C., Kiss, H., Saw, J. H., Senin, P., Yang, C., Chatterji, S., et al. (2009) · PLoS ONE · doi:10.1371/journal.pone.0005299 · Cited by 332
Meta-IDBA: a de Novo assembler for metagenomic data
Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr216 · Cited by 323
Self-citationIDBA – A Practical Iterative de Bruijn Graph De Novo Assembler
Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-12683-3_28 · Cited by 293
Self-citationDe novo fragment assembly with short mate-paired reads: Does the read length matter?
Chaisson, M. J., Brinza, D., & Pevzner, P. A. (2009) · Genome Research · doi:10.1101/gr.079053.108 · Cited by 279
Whole Genome Amplification and De novo Assembly of Single Bacterial Cells
Rodrigue, S., Malmstrom, R. R., Berlin, A. M., Birren, B. W., Henn, M. R., & Chisholm, S. W. (2009) · PLoS ONE · doi:10.1371/journal.pone.0006864 · Cited by 258
Efficient de novo assembly of single-cell bacterial genomes from short-read data sets
Chitsaz, H., Yee-Greenbaum, J. L., Tesler, G., Lombardo, M.-J., Dupont, C. L., Badger, J. H., Novotny, M., Rusch, D. B., Fraser, L. J., Gormley, N. A., et al. (2011) · Nature Biotechnology · doi:10.1038/nbt.1966 · Cited by 236
Zerbino, D. R., McEwen, G. K., Margulies, E. H., & Birney, E. (2009) · PLoS ONE · doi:10.1371/journal.pone.0008407 · Cited by 223
Phenotypic connections in surprising places
Linghu, B., & DeLisi, C. (2010) · Genome biology · doi:10.1186/gb-2010-11-4-116 · Cited by 128
Error correction of high-throughput sequencing datasets with non-uniform coverage
Medvedev, P., Scott, E., Kakaradov, B., & Pevzner, P. A. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr208 · Cited by 118
Cited by
QUAST: quality assessment tool for genome assemblies
Gurevich, A., Saveliev, V., Vyahhi, N., & Tesler, G. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt086 · Cited by 11,172
Li, D., Liu, C.-M., Luo, R., Sadakane, K., & Lam, T.-W. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv033 · Cited by 9,893
SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler
Luo, R., Liu, B., Xie, Y., Li, Z., Huang, W., Yuan, J., He, G., Chen, Y., Pan, Q., Liu, Y., et al. (2012) · Gigascience · doi:10.1186/2047-217x-1-18 · Cited by 5,307
Self-citationmetaSPAdes: a new versatile metagenomic assembler
Nurk, S., Meleshko, D., Korobeynikov, A., & Pevzner, P. A. (2017) · Genome Research · doi:10.1101/gr.213959.116 · Cited by 4,496
The Genome Standards Consortium, Bowers, R. M., Kyrpides, N. C., Stepanauskas, R., Harmon-Smith, M., Doud, D., Reddy, T. B. K., Schulz, F., Jarett, J., Rivers, A. R., et al. (2017) · Nature Biotechnology · doi:10.1038/nbt.3893 · Cited by 2,624
Metadata
- Authors
- Peng, Y., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-04-11
- Volume
- 28
- Issue
- 11
- Pages
- 1420-1428
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2141920662
- Cited by
- 2,989
- References
- 21
- FWCI
- 33.57
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.