The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Assembly of long, error-prone reads using repeat graphs
Open accessPublished version of a preprint
Abstract
Accurate genome assembly is hampered by repetitive regions. Although long single molecule sequencing reads are better able to resolve genomic repeats than short-read data, most long-read assembly algorithms do not provide the repeat characterization necessary for producing optimal assemblies. Here, we present Flye, a long-read assembly algorithm that generates arbitrary paths in an unknown repeat graph, called disjointigs, and constructs an accurate repeat graph from these error-riddled disjointigs. We benchmark Flye against five state-of-the-art assemblers and show that it generates better or comparable assemblies, while being an order of magnitude faster. Flye nearly doubled the contiguity of the human genome assembly (as measured by the NGA50 assembly quality metric) compared with existing assemblers.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The filtered reads were genome assembled de novo using Flye, and quality was evaluated using QUAST [20, 21].”
From Comparative Genomics-Based Evaluation of Lacticaseibacillus rhamnosus KFOM 0134 as a Probiotic against Staphylococcus aureus (2026) · cites this paper as [21]
Citations
Cites
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 · cited 1×
“For example, the SPAdes assembler (Bankevich et al., 2012) constructs the assembly graph of individual reads, uses it for repeat resolution, and outputs the resulting scaffolds (Prjibelsky et al.”
MethodSelf-citationQUAST: 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
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
Unicycler: Resolving bacterial genome assemblies from short and long sequencing reads
Wick, R. R., Judd, L. M., Gorrie, C. L., & Holt, K. E. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005595 · Cited by 8,653
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 · cited 1×
“Vertex B results in points (2, 5), (2, 10), and (5, 10); vertex C results in points (3, 6), (3, 11), and (6, 11); vertex D results in points (4, 7), (4, 12), and (7, 12); and vertex E results in the point (8, 13).”
Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data
Chin, C.-S., Alexander, D. H., Marks, P., Klammer, A. A., Drake, J., Heiner, C., Clum, A., Copeland, A., Huddleston, J., Eichler, E. E., et al. (2013) · Nature Methods · doi:10.1038/nmeth.2474 · Cited by 4,029 · cited 3×
“We ignored small connected components in the bacterial assembly graphs (which represent plasmids that do not share repeats with chromosomes) and classified an assembly as (1) complete if the assembly graph consists of a single loop-edge representing a circular chromosome, (2) semicomplete if the assembly graph contain…”
BackgroundMethodBandage: interactive visualization of de novo genome assemblies
Wick, R. R., Schultz, M. B., Zobel, J., & Holt, K. E. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv383 · Cited by 3,029
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 1×
“Flye thus applies Edmonds’ algorithm (Edmonds, 1965) to find a maximum weight matching in the transition graph and uses this matching for untangling the contracted repeat graph.”
MethodPhased 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
Nanopore sequencing and assembly of a human genome with ultra-long reads
Jain, M., Koren, S., Miga, K. H., Quick, J., Rand, A. C., Sasani, T. A., Tyson, J. R., Beggs, A. D., Dilthey, A. T., Fiddes, I. T., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4060 · Cited by 1,892
Cited by
Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm
Cheng, H., Concepcion, G. T., Feng, X., Zhang, H., & Li, H. (2021) · Nature Methods · doi:10.1038/s41592-020-01056-5 · Cited by 5,859
The complete sequence of a human genome
Nurk, S., Koren, S., Rhie, A., Rautiainen, M., Bzikadze, A. V., Mikheenko, A., Vollger, M. R., Altemose, N., Uralsky, L., Gershman, A., et al. (2022) · Science · doi:10.1126/science.abj6987 · Cited by 3,136
“A GA-rich region in the p-arm pseudoautosomal region (PAR) was patched with a Flye (96) trio-binned (97) and medaka polished assembly.”
MethodSelf-citationOpportunities and challenges in long-read sequencing data analysis
Amarasinghe, S. L., Su, S., Dong, X., Zappia, L., Ritchie, M. E., & Gouil, Q. (2020) · Genome Biology · doi:10.1186/s13059-020-1935-5 · Cited by 2,530
Nanopore sequencing technology, bioinformatics and applications
Wang, Y., Zhao, Y., Bollas, A., Wang, Y., & Au, K. F. (2021) · Nature Biotechnology · doi:10.1038/s41587-021-01108-x · Cited by 1,753
“…Flye improves genome assembly at long and highly repetitive regions by constructing an assembly graph from concatenated disjoint genomic segments 110 ; Miniasm uses all-versus-all read self-mapping for ultrafast assembly 107 , although postassembly polishing is necessary for higher accuracy.”
BackgroundVersatile genome assembly evaluation with QUAST-LG
Mikheenko, A., Prjibelski, A., Saveliev, V., Antipov, D., & Gurevich, A. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty266 · Cited by 1,527
Metadata
- Authors
- Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A.
- Affiliations
- University of California San Diego (US)
- Australian National University (AU)
- Corresponding author
- Pevzner, Pavel A.
- Venue
- Nature Biotechnology
- Published
- 2019-04-01
- Volume
- 37
- Issue
- 5
- Pages
- 540-546
- ISSN
- 0733-222X (ISSN-L)
- 1087-0156
- 1546-1696
- OpenAlex
- W2788228074
- Cited by
- 5,986
- References
- 42
- Citations by year
- 2026: 1166 · 2025: 1291 · 2024: 1191 · 2023: 858 · 2022: 635 · 2021: 535 · 2020: 244 · 2019: 52
- FWCI
- 122.96
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- cc-by-nc-nd
- www.springer.com/tdm (tdm)
- Locations
- Nature Biotechnology (publishedVersion)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc-nd)
- PubMed (publishedVersion)
- Research in Computational Molecular Biology
- Funders
- National Science Foundation
- Nature
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genomic variations and chromosomal abnormalities
- Keywords
- long-read genome assembly, Flye, repetitive DNA, single-molecule sequencing, assembly contiguity, N50, human genome assembly
- MeSH terms
- Algorithms, Humans, Repetitive Sequences, Nucleic Acid, Software, Genome, Human, Genome, Bacterial, Sequence Analysis, DNA, Genomics, Molecular Sequence Annotation, High-Throughput Nucleotide Sequencing
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: Assembly of long, error-prone reads using repeat graphs. https://app.cochat.ai/papers/10.1038/s41587-019-0072-8
- The paper
- Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A. (2019). Assembly of long, error-prone reads using repeat graphs. Nature Biotechnology. https://doi.org/10.1038/s41587-019-0072-8
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.