Syncmers are more sensitive than minimizers for selecting conserved k ‑mers in biological sequences
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Minimizers are widely used to select subsets of fixed-length substrings ( k -mers) from biological sequences in applications ranging from read mapping to taxonomy prediction and indexing of large datasets. The minimizer of a string of w consecutive k -mers is the k -mer with smallest value according to an ordering of all k -mers. Syncmers are defined here as a family of alternative methods which select k -mers by inspecting the position of the smallest-valued substring of length s < k within the k -mer. For example, a closed syncmer is selected if its smallest s -mer is at the start or end of the k -mer. At least one closed syncmer must be found in every window of length ( k − s ) k -mers. Unlike a minimizer, a syncmer is identified by its sequence alone, and is therefore synchronized in the following sense: if a given k -mer is selected from one sequence, it will also be selected from any other sequence. Also, minimizers can be deleted by mutations in flanking sequence, which cannot happen with syncmers. Experiments on minimizers with parameters used in the minimap2 read mapper and Kraken taxonomy prediction algorithm respectively show that syncmers can simultaneously achieve both lower density and higher conservation compared to minimizers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Minimap2: Pairwise alignment for nucleotide sequences
Li, H. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty191 · Cited by 14,807
Kraken: ultrafast metagenomic sequence classification using exact alignments
Wood, D. E., & Salzberg, S. L. (2014) · Genome Biology · doi:10.1186/gb-2014-15-3-r46 · Cited by 4,521
Reducing storage requirements for biological sequence comparison
Roberts, M., Hayes, W., Hunt, B. R., Mount, S. M., & Yorke, J. A. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth408 · Cited by 485 · cited 2×
“This was noted in (Roberts et al., 2004), where it was proposed that the problem can be addressed by introducing a special case at sequence terminals they called end-minimizers.”
Background
Cited by
Telomere-to-telomere assembly of diploid chromosomes with Verkko
Rautiainen, M., Nurk, S., Walenz, B. P., Logsdon, G. A., Porubsky, D., Rhie, A., Eichler, E. E., Phillippy, A. M., & Koren, S. (2023) · Nature Biotechnology · doi:10.1038/s41587-023-01662-6 · Cited by 409
A survey of k-mer methods and applications in bioinformatics
Moeckel, C., Mareboina, M., Konnaris, M. A., Chan, C. S. Y., Mouratidis, I., Montgomery, A., Chantzi, N., Pavlopoulos, G. A., & Georgakopoulos-Soares, I. (2024) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2024.05.025 · Cited by 131
Multiple genome alignment in the telomere-to-telomere assembly era
Kille, B., Balaji, A., Sedlazeck, F. J., Nute, M., & Treangen, T. J. (2022) · Genome Biology · doi:10.1186/s13059-022-02735-6 · Cited by 47
<tt>SAFARI</tt> : pangenome alignment of ancient DNA using purine/pyrimidine encodings
Rubin, J., van Waaij, J., Kraft, L., Sirén, J., Sackett, P. W., & Renaud, G. (2025) · NAR Genomics and Bioinformatics · doi:10.1093/nargab/lqaf170 · Cited by 1
“For example it still remains to develop a RYmer implementation for syncmers, an alternate minimizer selection system currently available in vg gi-raffe [ 59 ].”
Metadata
- Authors
- Edgar, R.
- Venue
- PeerJ
- Publisher
- PeerJ
- Published
- 2021-02-05
- Volume
- 9
- Pages
- e10805
- ISSN
- 2167-8359 (ISSN-L)
- OpenAlex
- W3128964673
- Cited by
- 115
- References
- 3
- FWCI
- 6.35
- 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.