Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Kolmogorov, Mikhail, Yuan, Jeffrey, Lin, Yu, Pevzner, Pavel A. · 2019 · Nature Biotechnology

Published 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

Crossref · 10.1038/s41587-019-0072-8

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 42 references

Cited by

See all 5,986

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
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.