On the complexity of pattern matching for highly compressed two-dimensional texts

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

    Research output: Contribution to journalArticle

    Abstract

    The complexity of problems related to two-dimensional texts is discussed. In a succinct description, larger rectangular subtexts are defined in terms of smaller parts in a way similar to that of Lemped-Ziv compression for 1D-text, or in string with shortned descriptions as in hierarchical graphs described by context-free graph grammars. The complexity increase in a 2D setting. It has been also shown that the compressed size of subrectangle of a compressed 2D array can grow exponentially, unlike the 1D case.

    Original languageEnglish (US)
    Pages (from-to)332-350
    Number of pages19
    JournalJournal of Computer and System Sciences
    Volume65
    Issue number2
    DOIs
    StatePublished - Sep 2002

      Fingerprint

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Networks and Communications
    • Computational Theory and Mathematics
    • Applied Mathematics

    Cite this