On the suffix automaton with mismatches

Authors:
Maxime Crochemore;Chiara Epifanio;Alessandra Gabriele;Filippo Mignosi
Affiliations:
Institut Gaspard-Monge, Université de Marne-la-Vallée, France and King's College, London, UK;Dipartimento di Matematica e Applicazioni, Università di Palermo, Italy;Dipartimento di Matematica e Applicazioni, Università di Palermo, Italy;Dipartimento di Informatica, Università dell'Aquila, Italy
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 15
Cited 1

Data structures and algorithms for approximate string matching

Journal of Complexity
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Automata for matching patterns

Handbook of formal languages, vol. 2
Text indexing and dictionary matching with one error

Journal of Algorithms
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
Words and special factors

Theoretical Computer Science
Reducing space for index implementation

Theoretical Computer Science
A Metric Index for Approximate String Matching

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Dictionary matching and indexing with errors and don't cares

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Languages with mismatches

Theoretical Computer Science
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics
A new method for approximate indexing and dictionary lookup with one error

Information Processing Letters
Indexing structures for approximate string matching

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Languages with mismatches and an application to approximate indexing

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Text indexing with errors

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Dictionary-symbolwise flexible parsing

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.