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

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

doi:10.1006/jcss.2002.1852

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 journal › Article › peer-review

30 Scopus citations

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 language	English (US)
Pages (from-to)	332-350
Number of pages	19
Journal	Journal of Computer and System Sciences
Volume	65
Issue number	2
DOIs	https://doi.org/10.1006/jcss.2002.1852
State	Published - Sep 2002

All Science Journal Classification (ASJC) codes

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

Access to Document

10.1006/jcss.2002.1852

Cite this

@article{975b7f6326d54d459a64f4431295d2b3,

title = "On the complexity of pattern matching for highly compressed two-dimensional texts",

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.",

author = "Piotr Berman and Marek Karpinski and Larmore, {Lawrence L.} and Wojciech Plandowski and Wojciech Rytter",

year = "2002",

month = sep,

doi = "10.1006/jcss.2002.1852",

language = "English (US)",

volume = "65",

pages = "332--350",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

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

AU - Berman, Piotr

AU - Karpinski, Marek

AU - Larmore, Lawrence L.

AU - Plandowski, Wojciech

AU - Rytter, Wojciech

PY - 2002/9

Y1 - 2002/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=23844456617&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23844456617&partnerID=8YFLogxK

U2 - 10.1006/jcss.2002.1852

DO - 10.1006/jcss.2002.1852

M3 - Article

SN - 0022-0000

VL - 65

SP - 332

EP - 350

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 2

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this