Abstract
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 first contribution is based on an algorithm that solves the general problem of maintaining a sequence of well-balanced parentheses under the operations insert, delete, and find nearest enclosing parenthesis pair. The main ideas behind the second contribution are: a linearization of two dimensional square patterns along the main diagonal, and new data structures to allow efficient manipulation of failure links.
| Original language | English |
|---|---|
| Pages | 392-401 |
| Number of pages | 10 |
| State | Published - 1993 |
| Externally published | Yes |
| Event | Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms - Austin, TX, USA Duration: 25 Jan 1993 → 27 Jan 1993 |
Conference
| Conference | Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Austin, TX, USA |
| Period | 25/01/93 → 27/01/93 |