The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Polypolish: Short-read polishing of long-read bacterial genome assemblies
Open accessAbstract
Long-read-only bacterial genome assemblies usually contain residual errors, most commonly homopolymer-length errors. Short-read polishing tools can use short reads to fix these errors, but most rely on short-read alignment which is unreliable in repeat regions. Errors in such regions are therefore challenging to fix and often remain after short-read polishing. Here we introduce Polypolish, a new short-read polisher which uses all-per-read alignments to repair errors in repeat sequences that other polishers cannot. Polypolish performed well in benchmarking tests using both simulated and real reads, and it almost never introduced errors during polishing. The best results were achieved by using Polypolish in combination with other short-read polishers.
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
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
Fast gapped-read alignment with Bowtie 2
Langmead, B., & Salzberg, S. L. (2012) · Nature Methods · doi:10.1038/nmeth.1923 · Cited by 56,400
Prodigal: prokaryotic gene recognition and translation initiation site identification
Hyatt, D., Chen, G.-L., LoCascio, P. F., Land, M. L., Larimer, F. W., & Hauser, L. J. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-119 · Cited by 12,587
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
Self-citationAssembly 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
GTDB-Tk: a toolkit to classify genomes with the Genome Taxonomy Database
Chaumeil, P.-A., Mussig, A. J., Hugenholtz, P., & Parks, D. H. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz848 · Cited by 5,259
Mash: fast genome and metagenome distance estimation using MinHash
Ondov, B. D., Treangen, T. J., Melsted, P., Mallonee, A. B., Bergman, N. H., Koren, S., & Phillippy, A. M. (2016) · Genome biology · doi:10.1186/s13059-016-0997-x · Cited by 3,373
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
ISfinder: the reference centre for bacterial insertion sequences
Siguier, P. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj014 · Cited by 2,767
Ancient DNA and the rewriting of human history: be sparing with Occam’s razor
Haber, M., Mezzavilla, M., Xue, Y., & Tyler-Smith, C. (2016) · Genome Biology · doi:10.1186/s13059-015-0866-z · Cited by 1,924
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
ART: a next-generation sequencing read simulator
Huang, W., Li, L., Myers, J. R., & Marth, G. T. (2012) · Bioinformatics · doi:10.1093/bioinformatics/btr708 · Cited by 1,596
A complete domain-to-species taxonomy for Bacteria and Archaea
Parks, D. H., Chuvochina, M., Chaumeil, P.-A., Rinke, C., Mussig, A. J., & Hugenholtz, P. (2020) · Nature Biotechnology · doi:10.1038/s41587-020-0501-8 · Cited by 1,530
Fast and accurate long-read assembly with wtdbg2
Ruan, J., & Li, H. (2020) · Nature Methods · doi:10.1038/s41592-019-0669-3 · Cited by 1,380
NextPolish: a fast and efficient genome polishing tool for long-read assembly
Hu, J., Fan, J., Sun, Z., & Liu, S. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz891 · Cited by 1,219
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
Self-citationOne chromosome, one contig: complete microbial genomes from long-read sequencing and assembly
Koren, S., & Phillippy, A. M. (2015) · Current Opinion in Microbiology · doi:10.1016/j.mib.2014.11.014 · Cited by 410
The genome polishing tool POLCA makes fast and accurate corrections in genome assemblies
Zimin, A. V., & Salzberg, S. L. (2020) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1007981 · Cited by 406
Finding, visualizing, and quantifying latent structure across diverse animal vocal repertoires
Sainburg, T., Thielk, M., & Gentner, T. Q. (2020) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1008228 · Cited by 319
Benchmarking of long-read assemblers for prokaryote whole genome sequencing
Wick, R. R., & Holt, K. E. (2021) · F1000Research · doi:10.12688/f1000research.21782.4 · Cited by 278
Self-citationEdlib: a C/C ++ library for fast, exact sequence alignment using edit distance
Šošić, M., & Šikić, M. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btw753 · Cited by 245
Benchmarking of long-read assemblers for prokaryote whole genome sequencing
Wick, R. R., & Holt, K. E. (2019) · F1000Research · doi:10.12688/f1000research.21782.1 · Cited by 230
Self-citationErrors in long-read assemblies can critically affect protein prediction
Watson, M., & Warr, A. (2019) · Nature Biotechnology · doi:10.1038/s41587-018-0004-z · Cited by 224
Clark, S. C., Egan, R., Frazier, P. I., & Wang, Z. (2013) · Bioinformatics · doi:10.1093/bioinformatics/bts723 · Cited by 186
Badread: simulation of error-prone long reads
Wick, R. R. (2019) · The Journal of Open Source Software · doi:10.21105/joss.01316 · Cited by 155
Self-citationHyPo: Super Fast & Accurate Polisher for Long Read Genome AssembliesPreprint
Kundu, R., Casey, J., & Sung, W.-K. K. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2019.12.19.882506 · Cited by 136
ntEdit: scalable genome sequence polishing
Warren, R. L., Coombe, L., Mohamadi, H., Zhang, J., Jaquish, B. C., Isabel, N., Jones, S. J. M., Bousquet, J., Bohlmann, J., & Birol, İ. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz400 · Cited by 111
Recovery of small plasmid sequences via Oxford Nanopore sequencing
Wick, R. R., Judd, L. M., Wyres, K. L., & Holt, K. E. (2021) · Microbial Genomics · doi:10.1099/mgen.0.000631 · Cited by 80
Self-citationComparison of De Novo Assembly Strategies for Bacterial Genomes
Zhang, P., Jiang, D., Wang, Y., Yao, X., Luo, Y., & Yang, Z. (2021) · International Journal of Molecular Sciences · doi:10.3390/ijms22147668 · Cited by 39
Cited by
Genomic atlas of Bifidobacterium infantis and B. longum informs infant probiotic design
Shao, Y., Wang, S., Gichuki, B. M., Stares, M. D., Rozday, T. J., Kumar, N., Browne, H. P., Dawson, N. J. R., Njunge, J. M., Tigoi, C., et al. (2026) · Cell · doi:10.1016/j.cell.2026.01.007 · Cited by 17
Metadata
- Authors
- Wick, R. R., & Holt, K. E.
- Venue
- PLOS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2022-01-24
- Volume
- 18
- Issue
- 1
- Pages
- e1009802
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W4226092504
- Cited by
- 703
- References
- 30
- FWCI
- 38.19
- Type
- journal article
- Language
- en
- Open access
- gold
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.