Abstract
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 language | English |
---|---|
Title of host publication | Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings |
Editors | Serge Abiteboul, Eli Shamir |
Publisher | Springer Verlag |
Pages | 215-226 |
Number of pages | 12 |
ISBN (Print) | 9783540582014 |
DOIs | |
State | Published - 1994 |
Externally published | Yes |
Event | Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 - Jerusalem, Isr Duration: 1 Jul 1994 → 1 Jul 1994 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 820 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 |
---|---|
City | Jerusalem, Isr |
Period | 1/07/94 → 1/07/94 |
Bibliographical note
Publisher Copyright:© 1994, Springer Verlag. All rights reserved.
Funding
In traditional pattern matching, all occurrences of pattern P in text T are sought. The pattern and text are explicitely given. For compressed matching, let c be a compression algorithm, and let c(D) be the result of c compressing data D: * Partially supported by NSF grant IRI-90-13055. ** Partially supported by NSF grant DMS-90-05833. *** Supported by DIMACS under NSF contract STC-88-09648. Partially supported by NSF grant IRI-90-13055. Partially supported by NSF grant DMS-90-05833. Supported by DIMACS under NSF contract STC-88-09648.
Funders | Funder number |
---|---|
National Science Foundation | IRI-90-13055, DMS-90-05833 |
National Sleep Foundation | |
Center for Discrete Mathematics and Theoretical Computer Science | STC-88-09648 |