Pattern matching in text compressed by using antidictionaries

Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (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.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 10th Annual Symposium, CPM 1999, Proceedings
EditorsMike Paterson, Maxime Crochemore
PublisherSpringer Verlag
Number of pages13
ISBN (Print)3540662782, 9783540662785
Publication statusPublished - 1999
Event10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999 - Warwick, United Kingdom
Duration: Jul 22 1999Jul 24 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999
Country/TerritoryUnited Kingdom

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Pattern matching in text compressed by using antidictionaries'. Together they form a unique fingerprint.

Cite this