On the complexity of pattern matching for highly compressed Two-Dimensional texts

Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojclech Plandowski, Wojciech Rytter

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    12 Scopus citations

    Abstract

    We consider the complexity of problems related to 2-dimensional texts (2d-texts) described succinctly. In a succinct description, larger rectangular sub-texts are defined in terms of smaller parts in a way similar to that of Lempel-Ziv compression for Idimensional texts, or in shortly described strings as in [9], or in hierarchical graphs described by context-free graph grammars. A given 2d-text T with many internal repetitions can have a hierarchical description (denoted Compress(T)) which is up to exponentially smaller and which can be the only part of the input for a patternmatching algorithm which gives information about T. Such a hierarchical description is given in terms of a straight-line program, see [9] or, equivalently, a 2-dimensional grammar. We consider compressed pattern-matching, where the input consists of a 2dpattern P and of a hierarchical description of a 2d-text T1 and fully compressed pattern-matching, where the input consists of hierarchical descriptions of both the pattern P and the text T. For 1-dimensional strings there exist polynomial-time deterministic algorithms for these problems, for similar types of succinct text descriptions [2, 6, 8, 9]. We show that the complexity dramatically increases in a 2-dimensional setting. For example, compressed 2d-matching is NP-complete, fully compressed 2d-matching is ∑2p-complete, and testing a given occurrence of a two dimensional compressed pattern is co-NP-complete. On the other hand, we give efficient algorithms for the related problems of randomized equality testing and testing for a given occurrence of an uncompressed pattern. We also show the surprising fact that the compressed size of a subrectangle of a compressed 2d-text can grow exponentially, unlike the one dimensional case.

    Original languageEnglish (US)
    Title of host publicationCombinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings
    EditorsAlberto Apostolico, Alberto Apostolico, Jotun Hein
    PublisherSpringer Verlag
    Pages40-51
    Number of pages12
    ISBN (Print)9783540632207
    DOIs
    StatePublished - Jan 1 1997
    Event8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 - Aarhus, Denmark
    Duration: Jun 30 1997Jul 2 1997

    Publication series

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

    Other

    Other8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997
    CountryDenmark
    CityAarhus
    Period6/30/977/2/97

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'On the complexity of pattern matching for highly compressed Two-Dimensional texts'. Together they form a unique fingerprint.

  • Cite this

    Berman, P., Karpinski, M., Larmore, L. L., Plandowski, W., & Rytter, W. (1997). On the complexity of pattern matching for highly compressed Two-Dimensional texts. In A. Apostolico, A. Apostolico, & J. Hein (Eds.), Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings (pp. 40-51). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1264). Springer Verlag. https://doi.org/10.1007/3-540-63220-4_48