Matching of Compressed Patterns with Character-Variables

Author Manfred Schmidt-Schauß



PDF
Thumbnail PDF

File

LIPIcs.RTA.2012.272.pdf
  • Filesize: 475 kB
  • 16 pages

Document Identifiers

Author Details

Manfred Schmidt-Schauß

Cite As Get BibTex

Manfred Schmidt-Schauß. Matching of Compressed Patterns with Character-Variables. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 272-287, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/LIPIcs.RTA.2012.272

Abstract

We consider the problem of finding an instance of a string-pattern s in a given string under compression by straight line programs (SLP). The variables of the string pattern can be instantiated by single characters. This is  a generalisation of the fully compressed pattern match, which is the task of finding a compressed string in another compressed string, which is known to have a polynomial time algorithm.
We mainly investigate patterns s that are  linear in the variables, i.e. variables  occur at most once in s, also known as partial words.
We  show that fully  compressed pattern matching  with linear patterns can be performed in polynomial time. A polynomial-sized  representation of all matches and all substitutions is also computed.
Also, a related algorithm is given that computes  all periods of a compressed linear pattern in polynomial time. A technical key result on the structure of partial words shows that an overlap of h+2 copies of a partial word w with at most h holes implies that w is strongly periodic.

Subject Classification

Keywords
  • matching
  • grammar-based compression
  • partial words

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail