Two-dimensional dictionary matching

Amihood Amir, Martin Farach

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

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={P1,...,Pk} 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 languageEnglish
Pages (from-to)233-239
Number of pages7
JournalInformation Processing Letters
Volume44
Issue number5
DOIs
StatePublished - 21 Dec 1992
Externally publishedYes

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

Fingerprint

Dive into the research topics of 'Two-dimensional dictionary matching'. Together they form a unique fingerprint.

Cite this