A Fast Suffix Automata Based Algorithm for Exact Online String Matching

@inproceedings{Faro2012AFS,
  title={A Fast Suffix Automata Based Algorithm for Exact Online String Matching},
  author={Simone Faro and Thierry Lecroq},
  booktitle={CIAA},
  year={2012}
}
Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. Automata play a very important role in the design of efficient solutions for the exact string matching problem. In this paper we propose a… CONTINUE READING