The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Time- and memory-efficient genome assembly with Raven
Open accessAbstract
Whole genome sequencing technologies are unable to invariably read DNA molecules intact, a shortcoming that assemblers try to resolve by stitching the obtained fragments back together. Here, we present methods for the improvement of de novo genome assembly from erroneous long reads incorporated into a tool called Raven. Raven maintains similar performance for various genomes and has accuracy on par with other assemblers that support third-generation sequencing data. It is one of the fastest options while having the lowest memory consumption on the majority of benchmarked datasets. Raven is designed to democratize genome assembly, being a simple and efficient tool while keeping high accuracy. Using a method for detection of false overlaps based on graph drawing, it can be employed for various genome sizes.
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Fast and accurate short read alignment with Burrows-Wheeler transform
Li, H., & Durbin, R. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp324 · Cited by 58,607
Minimap2: 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
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
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
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
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
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
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
Self-citation
Cited by
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
Trycycler: consensus long-read assemblies for bacterial genomes
Wick, R. R., Judd, L. M., Cerdeira, L. T., Hawkey, J., Méric, G., Vezina, B., Wyres, K. L., & Holt, K. E. (2021) · Genome Biology · doi:10.1186/s13059-021-02483-z · Cited by 531
Efficient assembly of nanopore reads via highly accurate and intact error correction
Chen, Y., Nie, F., Xie, S.-Q., Zheng, Y.-F., Dai, Q., Bray, T., Wang, Y.-X., Xing, J.-F., Huang, Z.-J., Wang, D.-P., et al. (2021) · Nature Communications · doi:10.1038/s41467-020-20236-7 · Cited by 446
Wang, Y., Gallagher, L. A., Andrade, P. A., Liu, A., Humphreys, I. R., Turkarslan, S., Cutler, K. J., Arrieta-Ortiz, M. L., Li, Y., Radey, M. C., et al. (2023) · Cell · doi:10.1016/j.cell.2023.08.017 · Cited by 108
Siewert, L. K., Korotaev, A., Sedzicki, J., Fromm, K., Pinschewer, D. D., & Dehio, C. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2202059119 · Cited by 17
Metadata
- Authors
- Vaser, R., & Šikić, M.
- Venue
- Nature Computational Science
- Published
- 2021-05-20
- Volume
- 1
- Issue
- 5
- Pages
- 332-336
- ISSN
- 2662-8457 (ISSN-L)
- OpenAlex
- W3164465449
- Cited by
- 522
- References
- 27
- FWCI
- 19.79
- Type
- journal article
- Language
- en
- Open access
- green
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: Time- and memory-efficient genome assembly with Raven. https://app.cochat.ai/papers/10.1038/s43588-021-00073-4
- The paper
- Vaser, R., & Šikić, M. (2021). Time- and memory-efficient genome assembly with Raven. Nature Computational Science. https://doi.org/10.1038/s43588-021-00073-4
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.