Skip to Main content Skip to Navigation
Journal articles

Minimally-overlapping words for sequence similarity search

Abstract : Motivation: Analysis of genetic sequences is usually based on finding similar parts of sequences, e.g. DNA reads and/or genomes. For big data, this is typically done via "seeds": simple similarities (e.g. exact matches) that can be found quickly. For huge data, sparse seeding is useful, where we only consider seeds at a subset of positions in a sequence. Results: Here we study a simple sparse-seeding method: using seeds at positions of certain "words" (e.g. ac, at, gc, or gt). Sensitivity is maximized by using words with minimal overlaps. That is because, in a random sequence, minimally-overlapping words are anti-clumped. We provide evidence that this is often superior to acclaimed "minimizer" sparse-seeding methods. Our approach can be unified with design of inexact (spaced and subset) seeds, further boosting sensitivity. Thus, we present a promising approach to sequence similarity search, with open questions on how to optimize it. Supplementary information: Supplementary data are available at Bioinformatics online.
Complete list of metadata
Contributor : Gregory Kucherov Connect in order to contact the contributor
Submitted on : Wednesday, December 23, 2020 - 8:59:02 PM
Last modification on : Friday, September 30, 2022 - 3:07:04 AM


Publisher files allowed on an open archive



Martin Frith, Laurent Noé, Gregory Kucherov. Minimally-overlapping words for sequence similarity search. Bioinformatics, Oxford University Press (OUP), 2020, ⟨10.1093/bioinformatics/btaa1054⟩. ⟨hal-03087470⟩



Record views


Files downloads