Skip to Main content Skip to Navigation
Conference papers

Languages of lossless seeds

Abstract : Several algorithms for similarity search employ seeding techniques to quickly discard very dissimilar regions. In this paper, we study theoretical properties of lossless seeds, i.e., spaced seeds having full sensitivity. We prove that lossless seeds coincide with languages of certain sofic subshifts, hence they can be recognized by finite automata. Moreover, we show that these subshifts are fully given by the number of allowed errors k and the seed margin ℓ. We also show that for a fixed k, optimal seeds must asymptotically satisfy ℓ ∈ Q(m^(k/k+1)).
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Karel Břinda Connect in order to contact the contributor
Submitted on : Thursday, July 3, 2014 - 3:35:21 PM
Last modification on : Thursday, September 29, 2022 - 2:21:15 PM
Long-term archiving on: : Friday, October 3, 2014 - 11:35:53 AM


Publisher files allowed on an open archive



Karel Brinda. Languages of lossless seeds. Proceedings of the 14th International Conference on Automata and Formal Languages (AFL), May 2014, Szeged, Hungary. pp.139-150, ⟨10.4204/eptcs.151.9⟩. ⟨hal-01018062⟩



Record views


Files downloads