## Abstract

Most traditional pattern matching algorithms solve the problem of finding all occurrences of a given pattern string P in a given text T. Another important paradigm is the dictionary matching problem. Let D={P_{1},...,P_{k}} be the dictionary. We seek the locations of all dictionary patterns that appear in a given text T. Previous dictionary matching algorithms have all involved exact matching of a set of strings. In this paper, we present an algorithm for the Two-Dimensional Dictionary Problem. The two-dimensional dictionary problem is that of finding each occurrence of a set of two-dimensional patterns in a text. Our algorithm runs in time O(|D|log k) preprocessing, O(|T|log k) text processing.

Original language | English |
---|---|

Pages (from-to) | 233-239 |

Number of pages | 7 |

Journal | Information Processing Letters |

Volume | 44 |

Issue number | 5 |

DOIs | |

State | Published - 21 Dec 1992 |

Externally published | Yes |

### Bibliographical note

Funding Information:Correspondence to: Processor A. Amir, College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280, USA. * Partially supported by NSF grant IRI-9013055. Email: amir@cc.gatech.edu. ** Supported by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center under NSF contract STC-8809648. Email: farach@dimacs.rutgers.edu.

## Keywords

- Algorithms
- analysis of algorithms
- dictionary matching
- pattern matching
- text processing