In this paper we focus on the construction of the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of Sk in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some wellknown words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Crochemore, M., Epifanio, C., Gabriele, A., & Mignosi, F. (2007). On the suffix automaton with mismatches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4783 LNCS, pp. 144–156). Springer Verlag. https://doi.org/10.1007/978-3-540-76336-9_15
Mendeley helps you to discover research relevant for your work.