Improved Dynamic Dictionary Matching

  title={Improved Dynamic Dictionary Matching},
  author={Amihood Amir and Martin Farach-Colton and Ramana M. Idury and Han La Poutr{\'e} and Alejandro A. Sch{\"a}ffer},
  journal={Inf. Comput.},
1 Introduction In the dynamic dictionary matching problem, a dictionary D contains a set of patterns that can change over time by insertion and deletion of individual patterns. The user also presents text strings and asks for all occurrences of any patterns in the text. The two main contributions of this paper are: 1) A faster algorithm for dynamic string dictionary matching with bounded alphabets, and 2) A dynamic dictionary matching algorithm for two dimensional texts and square patterns. The… CONTINUE READING