An efficient pattern matching algorithm on a subclass of context free grammars

研究成果: ジャーナルへの寄稿記事

4 引用 (Scopus)

抄録

There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a context-free grammar that only generates the string. An interesting and challenging problem is pattern matching on context-free grammars P of size m and T of size n, which are the descriptions of pattern string P of length M and text string T of length N, respectively. The goal is to solve the problem in time proportional only to m and n, not to M nor N. Kieffer et al. introduced a very practical grammar-based compression method called multilevel pattern matching code (MPM code). In this paper, we propose an efficient pattern matching algorithm which, given two MPM grammars P and T, performs in O(mn 2) time with O(mn) space. Our algorithm outperforms the previous best one by Miyazaki et al. which requires O(m 2n 2) time and O(mn) space.

元の言語英語
ページ(範囲)225-236
ページ数12
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3340
出版物ステータス出版済み - 2004

Fingerprint

Context free grammars
Context-free Grammar
Pattern matching
Pattern Matching
Matching Algorithm
Grammar
Strings
Text Compression
Multilevel Methods
Formal languages
Formal Languages
Data compression
Data Compression
Compression
Directly proportional

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

@article{c4b7b16481af41ee8db503588c8db51b,
title = "An efficient pattern matching algorithm on a subclass of context free grammars",
abstract = "There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a context-free grammar that only generates the string. An interesting and challenging problem is pattern matching on context-free grammars P of size m and T of size n, which are the descriptions of pattern string P of length M and text string T of length N, respectively. The goal is to solve the problem in time proportional only to m and n, not to M nor N. Kieffer et al. introduced a very practical grammar-based compression method called multilevel pattern matching code (MPM code). In this paper, we propose an efficient pattern matching algorithm which, given two MPM grammars P and T, performs in O(mn 2) time with O(mn) space. Our algorithm outperforms the previous best one by Miyazaki et al. which requires O(m 2n 2) time and O(mn) space.",
author = "Shunsuke Inenaga and Ayumi Shinohara and Masayuki Takeda",
year = "2004",
language = "English",
volume = "3340",
pages = "225--236",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - An efficient pattern matching algorithm on a subclass of context free grammars

AU - Inenaga, Shunsuke

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

PY - 2004

Y1 - 2004

N2 - There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a context-free grammar that only generates the string. An interesting and challenging problem is pattern matching on context-free grammars P of size m and T of size n, which are the descriptions of pattern string P of length M and text string T of length N, respectively. The goal is to solve the problem in time proportional only to m and n, not to M nor N. Kieffer et al. introduced a very practical grammar-based compression method called multilevel pattern matching code (MPM code). In this paper, we propose an efficient pattern matching algorithm which, given two MPM grammars P and T, performs in O(mn 2) time with O(mn) space. Our algorithm outperforms the previous best one by Miyazaki et al. which requires O(m 2n 2) time and O(mn) space.

AB - There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a context-free grammar that only generates the string. An interesting and challenging problem is pattern matching on context-free grammars P of size m and T of size n, which are the descriptions of pattern string P of length M and text string T of length N, respectively. The goal is to solve the problem in time proportional only to m and n, not to M nor N. Kieffer et al. introduced a very practical grammar-based compression method called multilevel pattern matching code (MPM code). In this paper, we propose an efficient pattern matching algorithm which, given two MPM grammars P and T, performs in O(mn 2) time with O(mn) space. Our algorithm outperforms the previous best one by Miyazaki et al. which requires O(m 2n 2) time and O(mn) space.

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

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

M3 - Article

VL - 3340

SP - 225

EP - 236

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -