{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T09:11:56Z","timestamp":1776417116286,"version":"3.51.2"},"reference-count":56,"publisher":"Oxford University Press (OUP)","issue":"13","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["14-50-00069"],"award-info":[{"award-number":["14-50-00069"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>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.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>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\u2014a 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.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>http:\/\/cab.spbu.ru\/software\/quast-lg<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/bty266","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T19:32:51Z","timestamp":1523561571000},"page":"i142-i150","source":"Crossref","is-referenced-by-count":1371,"title":["Versatile genome assembly evaluation with QUAST-LG"],"prefix":"10.1093","volume":"34","author":[{"given":"Alla","family":"Mikheenko","sequence":"first","affiliation":[{"name":"Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St. Petersburg State University, St. Petersburg, Russia"}]},{"given":"Andrey","family":"Prjibelski","sequence":"additional","affiliation":[{"name":"Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St. Petersburg State University, St. Petersburg, Russia"}]},{"given":"Vladislav","family":"Saveliev","sequence":"additional","affiliation":[{"name":"Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St. Petersburg State University, St. Petersburg, Russia"}]},{"given":"Dmitry","family":"Antipov","sequence":"additional","affiliation":[{"name":"Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St. Petersburg State University, St. Petersburg, Russia"}]},{"given":"Alexey","family":"Gurevich","sequence":"additional","affiliation":[{"name":"Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St. Petersburg State University, St. Petersburg, Russia"}]}],"member":"286","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"2023051604200626200_bty266-B1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.jda.2004.08.011","article-title":"Chaining algorithms for multiple genome comparison","volume":"3","author":"Abouelhoda","year":"2005","journal-title":"J. Discret. Algorithms"},{"key":"2023051604200626200_bty266-B2","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1093\/bioinformatics\/btv688","article-title":"hybridSPAdes: an algorithm for hybrid assembly of short and long reads","volume":"32","author":"Antipov","year":"2016","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B3","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1089\/cmb.2012.0021","article-title":"SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing","volume":"19","author":"Bankevich","year":"2012","journal-title":"J. Comput. Biol"},{"key":"2023051604200626200_bty266-B4","doi-asserted-by":"crossref","first-page":"211.","DOI":"10.1186\/1471-2105-15-211","article-title":"SSPACE-LongRead: scaffolding bacterial draft genomes using long read sequence information","volume":"15","author":"Boetzer","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"2023051604200626200_bty266-B5","doi-asserted-by":"crossref","first-page":"10.","DOI":"10.1186\/2047-217X-2-10","article-title":"Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species","volume":"2","author":"Bradnam","year":"2013","journal-title":"Gigascience"},{"key":"2023051604200626200_bty266-B6","doi-asserted-by":"crossref","first-page":"S18.","DOI":"10.1186\/1471-2105-14-S5-S18","article-title":"Optimal assembly for high throughput shotgun sequencing","volume":"14","author":"Bresler","year":"2013","journal-title":"BMC Bioinformatics"},{"key":"2023051604200626200_bty266-B7","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1038\/nature13907","article-title":"Resolving the complexity of the human genome using single-molecule sequencing","volume":"517","author":"Chaisson","year":"2014","journal-title":"Nature"},{"key":"2023051604200626200_bty266-B8","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1101\/gr.079053.108","article-title":"De novo fragment assembly with short mate-paired reads: does the read length matter?","volume":"19","author":"Chaisson","year":"2009","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B9","doi-asserted-by":"crossref","first-page":"e23501.","DOI":"10.1371\/journal.pone.0023501","article-title":"Meraculous: de novo genome assembly with short paired-end reads","volume":"6","author":"Chapman","year":"2011","journal-title":"PLoS ONE"},{"key":"2023051604200626200_bty266-B10","author":"Chapman","year":"2016"},{"key":"2023051604200626200_bty266-B11","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1038\/nmeth.4035","article-title":"Phased diploid genome assembly with single-molecule real-time sequencing","volume":"13","author":"Chin","year":"2016","journal-title":"Nat. Methods"},{"key":"2023051604200626200_bty266-B12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1093\/bioinformatics\/bts723","article-title":"ALE: a generic assembly likelihood evaluation framework for assessing the accuracy of genome and metagenome assemblies","volume":"29","author":"Clark","year":"2013","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B13","doi-asserted-by":"crossref","first-page":"2224","DOI":"10.1101\/gr.126599.111","article-title":"Assemblathon 1: a competitive assessment of de novo short read assembly methods","volume":"21","author":"Earl","year":"2011","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B14","doi-asserted-by":"crossref","first-page":"334.","DOI":"10.1186\/1756-0500-6-334","article-title":"De novo likelihood-based measures for comparing genome assemblies","volume":"6","author":"Ghodsi","year":"2013","journal-title":"BMC Res. Notes"},{"key":"2023051604200626200_bty266-B15","doi-asserted-by":"crossref","first-page":"227.","DOI":"10.1186\/s12859-015-0654-5","article-title":"Red: an intelligent, rapid, accurate tool for detecting repeats de-novo on the genomic scale","volume":"16","author":"Girgis","year":"2015","journal-title":"BMC Bioinformatics"},{"key":"2023051604200626200_bty266-B16","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.1073\/pnas.1017351108","article-title":"High-quality draft assemblies of mammalian genomes from massively parallel sequence data","volume":"108","author":"Gnerre","year":"2011","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2023051604200626200_bty266-B17","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1093\/bioinformatics\/btt086","article-title":"QUAST: quality assessment tool for genome assemblies","volume":"29","author":"Gurevich","year":"2013","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B18","doi-asserted-by":"crossref","first-page":"R47.","DOI":"10.1186\/gb-2013-14-5-r47","article-title":"REAPR: a universal tool for genome assembly evaluation","volume":"14","author":"Hunt","year":"2013","journal-title":"Genome Biol"},{"key":"2023051604200626200_bty266-B19","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1101\/gr.214346.116","article-title":"ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter","volume":"27","author":"Jackman","year":"2017","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B20","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1101\/gr.170720.113","article-title":"Efficient de novo assembly of highly heterozygous genomes from whole-genome shotgun short reads","volume":"24","author":"Kajitani","year":"2014","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B21","doi-asserted-by":"crossref","first-page":"2759","DOI":"10.1093\/bioinformatics\/btx304","article-title":"KMC 3: counting and manipulating k-mer statistics","volume":"33","author":"Kokot","year":"2017","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B22","author":"Kolmogorov","year":"2018"},{"key":"2023051604200626200_bty266-B23","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1101\/gr.215087.116","article-title":"Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation","volume":"27","author":"Koren","year":"2017","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B24","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1101\/gr.092759.109","article-title":"Circos: an information aesthetic for comparative genomics","volume":"19","author":"Krzywinski","year":"2009","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B25","doi-asserted-by":"crossref","first-page":"R12.","DOI":"10.1186\/gb-2004-5-2-r12","article-title":"Versatile and open software for comparing large genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biol"},{"key":"2023051604200626200_bty266-B26","doi-asserted-by":"crossref","first-page":"S4.","DOI":"10.1186\/1471-2105-15-S9-S4","article-title":"Near-optimal assembly for shotgun sequencing with noisy reads","volume":"15","author":"Lam","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"2023051604200626200_bty266-B27","doi-asserted-by":"crossref","first-page":"R84.","DOI":"10.1186\/gb-2014-15-6-r84","article-title":"LUMPY: a probabilistic framework for structural variant discovery","volume":"15","author":"Layer","year":"2014","journal-title":"Genome Biol"},{"key":"2023051604200626200_bty266-B28","author":"Li","year":"2013"},{"key":"2023051604200626200_bty266-B29","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1093\/bioinformatics\/btw152","article-title":"Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences","volume":"32","author":"Li","year":"2016","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B30","author":"Li","year":"2017"},{"key":"2023051604200626200_bty266-B31","doi-asserted-by":"crossref","first-page":"E8396","DOI":"10.1073\/pnas.1604560113","article-title":"Assembly of long error-prone reads using de Bruijn graphs","volume":"113","author":"Lin","year":"2016","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2023051604200626200_bty266-B32","doi-asserted-by":"crossref","first-page":"6494","DOI":"10.1093\/nar\/gki937","article-title":"Gene identification in novel eukaryotic genomes by self-training algorithm","volume":"33","author":"Lomsadze","year":"2005","journal-title":"Nucleic Acids Res"},{"key":"2023051604200626200_bty266-B33","doi-asserted-by":"crossref","first-page":"18.","DOI":"10.1186\/2047-217X-1-18","article-title":"SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler","volume":"1","author":"Luo","year":"2012","journal-title":"Gigascience"},{"key":"2023051604200626200_bty266-B34","doi-asserted-by":"crossref","first-page":"D986","DOI":"10.1093\/nar\/gkt958","article-title":"The Database of Genomic Variants: a curated collection of structural variation in the human genome","volume":"42","author":"MacDonald","year":"2014","journal-title":"Nucleic Acids Res"},{"key":"2023051604200626200_bty266-B35","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1093\/bioinformatics\/btt273","article-title":"GAGE-B: an evaluation of genome assemblers for bacterial organisms","volume":"29","author":"Magoc","year":"2013","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B36","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1093\/bioinformatics\/btw663","article-title":"KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies","volume":"33","author":"Mapleson","year":"2017","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B37","doi-asserted-by":"crossref","first-page":"e1005944.","DOI":"10.1371\/journal.pcbi.1005944","article-title":"MUMmer4: a fast and versatile genome alignment system","volume":"14","author":"Marcais","year":"2018","journal-title":"PLoS Comput. Biol"},{"key":"2023051604200626200_bty266-B38","doi-asserted-by":"crossref","first-page":"10.","DOI":"10.14806\/ej.17.1.200","article-title":"Cutadapt removes adapter sequences from high-throughput sequencing reads","volume":"17","author":"Martin","year":"2011","journal-title":"EMBnet.journal"},{"key":"2023051604200626200_bty266-B39","doi-asserted-by":"crossref","first-page":"3321","DOI":"10.1093\/bioinformatics\/btw379","article-title":"Icarus: visualizer for de novo assembly evaluation","volume":"32","author":"Mikheenko","year":"2016","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B40","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1093\/bioinformatics\/btv697","article-title":"MetaQUAST: evaluation of metagenome assemblies","volume":"32","author":"Mikheenko","year":"2016","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B41","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","article-title":"Assembly algorithms for next-generation sequencing data","volume":"95","author":"Miller","year":"2010","journal-title":"Genomics"},{"key":"2023051604200626200_bty266-B42","author":"Myers","year":"1995"},{"key":"2023051604200626200_bty266-B43","doi-asserted-by":"crossref","first-page":"2035","DOI":"10.1093\/bioinformatics\/btv057","article-title":"NxTrim: optimized trimming of Illumina mate pair reads","volume":"31","author":"O\u2019connell","year":"2015","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B44","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1101\/gr.193474.115","article-title":"Chromosome-scale shotgun assembly using an in vitro method for long-range linkage","volume":"26","author":"Putnam","year":"2016","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B45","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","article-title":"Reducing storage requirements for biological sequence comparison","volume":"20","author":"Roberts","year":"2004","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B46","doi-asserted-by":"crossref","first-page":"281.","DOI":"10.1186\/1471-2105-15-281","article-title":"BESST\u2013efficient scaffolding of large fragmented assemblies","volume":"15","author":"Sahlin","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"2023051604200626200_bty266-B47","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1101\/gr.131383.111","article-title":"GAGE: a critical evaluation of genome assemblies and assembly algorithms","volume":"22","author":"Salzberg","year":"2012","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B48","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1038\/nmeth.4458","article-title":"Critical Assessment of Metagenome Interpretation-a benchmark of metagenomics software","volume":"14","author":"Sczyrba","year":"2017","journal-title":"Nat. Methods"},{"key":"2023051604200626200_bty266-B49","doi-asserted-by":"crossref","first-page":"3210","DOI":"10.1093\/bioinformatics\/btv351","article-title":"BUSCO: assessing genome assembly and annotation completeness with single-copy orthologs","volume":"31","author":"Simao","year":"2015","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B50","author":"Smit","year":"2013"},{"key":"2023051604200626200_bty266-B51","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1101\/gr.214270.116","article-title":"Fast and accurate de novo genome assembly from long uncorrected reads","volume":"27","author":"Vaser","year":"2017","journal-title":"Genome Res"},{"key":"2023051604200626200_bty266-B52","doi-asserted-by":"crossref","first-page":"3262","DOI":"10.1093\/bioinformatics\/btv337","article-title":"Assembling short reads from jumping libraries with large insert sizes","volume":"31","author":"Vasilinetc","year":"2015","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B53","first-page":"581","author":"Wala","year":"2018"},{"key":"2023051604200626200_bty266-B54","doi-asserted-by":"crossref","first-page":"e112963.","DOI":"10.1371\/journal.pone.0112963","article-title":"Pilon: an integrated tool for comprehensive microbial variant detection and genome assembly improvement","volume":"9","author":"Walker","year":"2014","journal-title":"PLoS ONE"},{"key":"2023051604200626200_bty266-B55","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1093\/bioinformatics\/btt476","article-title":"The masurca genome assembler","volume":"29","author":"Zimin","year":"2013","journal-title":"Bioinformatics"},{"key":"2023051604200626200_bty266-B56","doi-asserted-by":"crossref","first-page":"160025.","DOI":"10.1038\/sdata.2016.25","article-title":"Extensive sequencing of seven human genomes to characterize benchmark reference materials","volume":"3","author":"Zook","year":"2016","journal-title":"Sci. Data"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/13\/i142\/50315697\/bioinformatics_34_13_i142.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/13\/i142\/50315697\/bioinformatics_34_13_i142.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T04:21:17Z","timestamp":1684210877000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/34\/13\/i142\/5045727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":56,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2018,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bty266","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,7,1]]},"published":{"date-parts":[[2018,6,27]]}}}