The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Versatile genome assembly evaluation with QUAST-LG
Open accessAbstract
Motivation: The emergence of high-throughput sequencing technologies revolutionized genomics in early 2000s. The next revolution came with the era of long-read sequencing. These technological advances along with novel computational approaches became the next step towards the automatic pipelines capable to assemble nearly complete mammalian-size genomes. Results: In this manuscript, we demonstrate performance of the state-of-the-art genome assembly software on six eukaryotic datasets sequenced using different technologies. To evaluate the results, we developed QUAST-LG—a tool that compares large genomic de novo assemblies against reference sequences and computes relevant quality metrics. Since genomes generally cannot be reconstructed completely due to complex repeat patterns and low coverage regions, we introduce a concept of upper bound assembly for a given genome and set of reads, and compute theoretical limits on assembly correctness and completeness. Using QUAST-LG, we show how close the assemblies are to the theoretical optimum, and how far this optimum is from the finished reference. Availability and implementation: http://cab.spbu.ru/software/quast-lg Supplementary information: Supplementary data are available at Bioinformatics online.
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
Cutadapt removes adapter sequences from high-throughput sequencing reads
Martin, M. (2011) · EMBnet.journal · doi:10.14806/ej.17.1.200 · Cited by 33,889
SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing
Bankevich, A., Nurk, S., Antipov, D., Gurevich, A. A., Dvorkin, M., Kulikov, A. S., Lesin, V. M., Nikolenko, S. I., Pham, S., Prjibelski, A. D., et al. (2012) · Journal of Computational Biology · doi:10.1089/cmb.2012.0021 · Cited by 25,987
Self-citationMinimap2: Pairwise alignment for nucleotide sequences
Li, H. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty191 · Cited by 14,807
BUSCO: assessing genome assembly and annotation completeness with single-copy orthologs
Simão, F. A., Waterhouse, R. M., Ioannidis, P., Kriventseva, E. V., & Zdobnov, E. M. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv351 · Cited by 13,344
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
Self-citationCircos: An information aesthetic for comparative genomics
Krzywinski, M., Schein, J., Birol, İ., Connors, J., Gascoyne, R., Horsman, D., Jones, S. J., & Marra, M. A. (2009) · Genome Research · doi:10.1101/gr.092759.109 · Cited by 10,964
Walker, B. J., Abeel, T., Shea, T., Priest, M., Abouelliel, A., Sakthikumar, S., Cuomo, C. A., Zeng, Q., Wortman, J., Young, S. K., et al. (2014) · PLoS ONE · doi:10.1371/journal.pone.0112963 · Cited by 9,197
Canu: scalable and accurate long-read assembly via adaptive k -mer weighting and repeat separation
Koren, S., Walenz, B. P., Berlin, K., Miller, J. R., Bergman, N. H., & Phillippy, A. M. (2017) · Genome Research · doi:10.1101/gr.215087.116 · Cited by 7,304
Assembly of long, error-prone reads using repeat graphs
Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0072-8 · Cited by 5,986
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
Versatile and open software for comparing large genomes
Kurtz, S., Phillippy, A., Delcher, A. L., Smoot, M., Shumway, M., Antonescu, C., & Salzberg, S. L. (2004) · Genome Biology · doi:10.1186/gb-2004-5-2-r12 · Cited by 5,254
Fast and accurate de novo genome assembly from long uncorrected reads
Vaser, R., Sović, I., Nagarajan, N., & Šikić, M. (2017) · Genome Research · doi:10.1101/gr.214270.116 · Cited by 3,043
MUMmer4: A fast and versatile genome alignment system
Marçais, G., Delcher, A. L., Phillippy, A. M., Coston, R., Salzberg, S. L., & Zimin, A. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005944 · Cited by 2,484
Phased diploid genome assembly with single-molecule real-time sequencing
Chin, C.-S., Peluso, P., Sedlazeck, F. J., Nattestad, M., Concepcion, G. T., Clum, A., Dunn, C., O'Malley, R., Figueroa-Balderas, R., Morales-Cruz, A., et al. (2016) · Nature Methods · doi:10.1038/nmeth.4035 · Cited by 1,904
LUMPY: a probabilistic framework for structural variant discovery
Layer, R. M., Chiang, C., Quinlan, A. R., & Hall, I. M. (2014) · Genome Biology · doi:10.1186/gb-2014-15-6-r84 · Cited by 1,554
High-quality draft assemblies of mammalian genomes from massively parallel sequence data
Gnerre, S., MacCallum, I., Przybylski, D., Ribeiro, F. J., Burton, J. N., Walker, B. J., Sharpe, T., Hall, G., Shea, T. P., Sykes, S., et al. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1017351108 · Cited by 1,533
Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences
Li, H. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw152 · Cited by 1,508
Zimin, A. V., Marçais, G., Puiu, D., Roberts, M., Salzberg, S. L., & Yorke, J. A. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt476 · Cited by 1,463
The Database of Genomic Variants: a curated collection of structural variation in the human genome
MacDonald, J. R., Ziman, R., Yuen, R. K. C., Feuk, L., & Scherer, S. W. (2014) · Nucleic Acids Research · doi:10.1093/nar/gkt958 · Cited by 1,342
Assembly algorithms for next-generation sequencing data
Miller, J. R., Koren, S., & Sutton, G. (2010) · Genomics · doi:10.1016/j.ygeno.2010.03.001 · Cited by 1,154
Efficient de novo assembly of highly heterozygous genomes from whole-genome shotgun short reads
Kajitani, R., Toshimoto, K., Noguchi, H., Toyoda, A., Ogura, Y., Okuno, M., Yabana, M., Harada, M., Nagayasu, E., Maruyama, H., et al. (2014) · Genome Research · doi:10.1101/gr.170720.113 · Cited by 1,017
Gene identification in novel eukaryotic genomes by self-training algorithm
Lomsadze, A. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki937 · Cited by 975
Critical Assessment of Metagenome Interpretation—a benchmark of metagenomics software
Sczyrba, A., Hofmann, P., Belmann, P., Koslicki, D., Janssen, S., Dröge, J., Gregor, I., Majda, S., Fiedler, J., Dahms, E., et al. (2017) · Nature Methods · doi:10.1038/nmeth.4458 · Cited by 870
Self-citationExtensive sequencing of seven human genomes to characterize benchmark reference materials
Zook, J. M., Catoe, D., McDaniel, J., Vang, L., Spies, N., Sidow, A., Weng, Z., Liu, Y., Mason, C. E., Alexander, N., et al. (2016) · Scientific Data · doi:10.1038/sdata.2016.25 · Cited by 811
Resolving the complexity of the human genome using single-molecule sequencing
Chaisson, M. J. P., Huddleston, J., Dennis, M. Y., Sudmant, P. H., Malig, M., Hormozdiari, F., Antonacci, F., Surti, U., Sandstrom, R., Boitano, M., et al. (2015) · Nature · doi:10.1038/nature13907 · Cited by 783
KMC 3: counting and manipulating k-mer statistics
Kokot, M., Długosz, M., & Deorowicz, S. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx304 · Cited by 750
Chromosome-scale shotgun assembly using an in vitro method for long-range linkage
Putnam, N. H., O'Connell, B. L., Stites, J. C., Rice, B. J., Blanchette, M., Calef, R., Troll, C. J., Fields, A., Hartley, P. D., Sugnet, C. W., et al. (2016) · Genome Research · doi:10.1101/gr.193474.115 · Cited by 732
MetaQUAST: evaluation of metagenome assemblies
Mikheenko, A., Saveliev, V., & Gurevich, A. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btv697 · Cited by 711
Self-citationGAGE: A critical evaluation of genome assemblies and assembly algorithms
Salzberg, S. L., Phillippy, A. M., Zimin, A., Puiu, D., Magoc, T., Koren, S., Treangen, T. J., Schatz, M. C., Delcher, A. L., Roberts, M., et al. (2012) · Genome Research · doi:10.1101/gr.131383.111 · Cited by 682
ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter
Jackman, S. D., Vandervalk, B. P., Mohamadi, H., Chu, J., Yeo, S., Hammond, S. A., Jahesh, G., Khan, H., Coombe, L., Warren, R. L., et al. (2017) · Genome Research · doi:10.1101/gr.214346.116 · Cited by 679
Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species
Bradnam, K. R., Fass, J. N., Alexandrov, A., Baranay, P., Bechner, M., Birol, I., Boisvert, S., Chapman, J. A., Chapuis, G., Chikhi, R., et al. (2013) · Gigascience · doi:10.1186/2047-217x-2-10 · Cited by 670
hybrid SPA des: an algorithm for hybrid assembly of short and long reads
Antipov, D., Korobeynikov, A., McLean, J. S., & Pevzner, P. A. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btv688 · Cited by 659
Self-citationKAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies
Mapleson, D., Garcia Accinelli, G., Kettleborough, G., Wright, J., & Clavijo, B. J. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btw663 · Cited by 538
SSPACE-LongRead: scaffolding bacterial draft genomes using long read sequence information
Boetzer, M., & Pirovano, W. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-211 · Cited by 520
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
Reducing storage requirements for biological sequence comparison
Roberts, M., Hayes, W., Hunt, B. R., Mount, S. M., & Yorke, J. A. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth408 · Cited by 485
SvABA: genome-wide detection of structural variants and indels by local assembly
Wala, J. A., Bandopadhayay, P., Greenwald, N. F., O'Rourke, R., Sharpe, T., Stewart, C., Schumacher, S., Li, Y., Weischenfeldt, J., Yao, X., et al. (2018) · Genome Research · doi:10.1101/gr.221028.117 · Cited by 442
REAPR: a universal tool for genome assembly evaluation
Hunt, M., Kikuchi, T., Sanders, M., Newbold, C., Berriman, M., & Otto, T. D. (2013) · Genome Biology · doi:10.1186/gb-2013-14-5-r47 · Cited by 405
Assembly of long error-prone reads using de Bruijn graphs
Lin, Y., Yuan, J., Kolmogorov, M., Shen, M. W., Chaisson, M., & Pevzner, P. A. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1604560113 · Cited by 382
De 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
Red: an intelligent, rapid, accurate tool for detecting repeats de-novo on the genomic scale
Girgis, H. Z. (2015) · BMC Bioinformatics · doi:10.1186/s12859-015-0654-5 · Cited by 243
Meraculous: De Novo Genome Assembly with Short Paired-End Reads
Chapman, J. A., Ho, I., Sunkara, S., Luo, S., Schroth, G. P., & Rokhsar, D. S. (2011) · PLoS ONE · doi:10.1371/journal.pone.0023501 · Cited by 212
Clark, S. C., Egan, R., Frazier, P. I., & Wang, Z. (2013) · Bioinformatics · doi:10.1093/bioinformatics/bts723 · Cited by 186
NxTrim: optimized trimming of Illumina mate pair reads
O’Connell, J., Schulz-Trieglaff, O., Carlson, E., Hims, M. M., Gormley, N. A., & Cox, A. J. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv057 · Cited by 166
GAGE-B: an evaluation of genome assemblers for bacterial organisms
Magoč, T., Pabinger, S., Canzar, S., Liu, X., Su, Q., Puiu, D., Tallon, L. J., & Salzberg, S. L. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt273 · Cited by 165
Icarus: visualizer for de novo assembly evaluation
Mikheenko, A., Valin, G., Prjibelski, A., Saveliev, V., & Gurevich, A. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw379 · Cited by 164
Self-citationBESST - Efficient scaffolding of large fragmented assemblies
Sahlin, K., Vezzi, F., Nystedt, B., Lundeberg, J., & Arvestad, L. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-281 · Cited by 155
Optimal assembly for high throughput shotgun sequencing
Bresler, G., Bresler, M., & Tse, D. N. C. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-s5-s18 · Cited by 88
Assembling short reads from jumping libraries with large insert sizes
Vasilinetc, I., Prjibelski, A. D., Gurevich, A. A., Korobeynikov, A., & Pevzner, P. A. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv337 · Cited by 79
Self-citationChaining algorithms for multiple genome comparison
Abouelhoda, M. I., & Ohlebusch, E. (2004) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2004.08.011 · Cited by 74
De novo likelihood-based measures for comparing genome assemblies
Ghodsi, M., Hill, C. M., Astrovskaya, I., Lin, H., Sommer, D. D., Koren, S., & Pop, M. (2013) · BMC Research Notes · doi:10.1186/1756-0500-6-334 · Cited by 51
Near-optimal assembly for shotgun sequencing with noisy reads
Lam, K.-K., Khalak, A., & Tse, D. N. C. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-s9-s4 · Cited by 46
Cited by
Assembly of long, error-prone reads using repeat graphs
Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0072-8 · Cited by 5,986
Merqury: reference-free quality, completeness, and phasing assessment for genome assemblies
Rhie, A., Walenz, B. P., Koren, S., & Phillippy, A. M. (2020) · Genome Biology · doi:10.1186/s13059-020-02134-9 · Cited by 3,643
YaHS: yet another Hi-C scaffolding tool
Zhou, C., McCarthy, S. A., & Durbin, R. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btac808 · Cited by 2,440
A draft human pangenome reference.
Liao, W.-W., Asri, M., Ebler, J., Doerr, D., Haukness, M., Hickey, G., Lu, S., Lucas, J. K., Monlong, J., Abel, H. J., et al. (2023) · Nature · doi:10.1038/s41586-023-05896-x · Cited by 1,129
“QUAST was invoked with the following command: python /opt/quast/quast-5.”
MethodInfluentialmetaFlye: scalable long-read metagenome assembly using repeat graphs
Kolmogorov, M., Bickhart, D. M., Behsaz, B., Gurevich, A., Rayko, M., Shin, S. B., Kuhn, K., Yuan, J., Polevikov, E., Smith, T. P. L., et al. (2020) · Nature Methods · doi:10.1038/s41592-020-00971-x · Cited by 1,077
Self-citation
Metadata
- Authors
- Mikheenko, A., Prjibelski, A., Saveliev, V., Antipov, D., & Gurevich, A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2018-06-27
- Volume
- 34
- Issue
- 13
- Pages
- i142-i150
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2808352813
- Cited by
- 1,527
- References
- 52
- FWCI
- 23.70
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.