Pattern matching in text compressed by using antidictionaries

Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa

研究成果: Conference contribution

18 被引用数 (Scopus)

抄録

In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochemore et al. (1998). We show an algorithm which preprocesses a pattern of length m and an antidictionary M in O(m2 + ||M||) time, and then scans a compressed text of length n in O(n + r) time to find all pattern occurrences, where ||M|| is the total length of strings in M and r is the number of the pattern occurrences.

本文言語English
ホスト出版物のタイトルCombinatorial Pattern Matching - 10th Annual Symposium, CPM 1999, Proceedings
編集者Mike Paterson, Maxime Crochemore
出版社Springer Verlag
ページ37-49
ページ数13
ISBN(印刷版)3540662782, 9783540662785
DOI
出版ステータスPublished - 1999
外部発表はい
イベント10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999 - Warwick, United Kingdom
継続期間: 1999 7月 221999 7月 24

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1645
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999
国/地域United Kingdom
CityWarwick
Period99/7/2299/7/24

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Pattern matching in text compressed by using antidictionaries」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル