Optimal two-dimensional compressed matching

Amihood Amir, Gary Benson, Martin Farach

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations


Recent proliferation of digitized data and the expected unprecedented growth in the volume of stored and transmitted data motivated the definition of the compressed matching paradigm. This is the problem of efficiently finding a pattern P in a compressed text T without the need to decompress. We present the first optimal two-dimensional compressed matching algorithm. The compression under consideration is the two dimensional run-length compression, used by FAX transmission. We achieve optimal time by proving new properties of two-dimensional periodicity. This enables performing duels in which no witness is required. At the heart of the dueling idea lies the concept that two overlapping occurrences of a pattern in a text can use the content of a predetermined text position or witness in the overlap to eliminate one of them. Finding witnesses is a costly operation in a compressed text, thus the importance of witness-free dueling.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings
EditorsSerge Abiteboul, Eli Shamir
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540582014
StatePublished - 1994
Externally publishedYes
EventProceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 - Jerusalem, Isr
Duration: 1 Jul 19941 Jul 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume820 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceProceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94
CityJerusalem, Isr

Bibliographical note

Publisher Copyright:
© 1994, Springer Verlag. All rights reserved.


Dive into the research topics of 'Optimal two-dimensional compressed matching'. Together they form a unique fingerprint.

Cite this