@inproceedings{4b07bd25ca4c4208b91524250bf0d540,

title = "Pattern matching in text compressed by using antidictionaries",

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

author = "Yusuke Shibata and Masayuki Takeda and Ayumi Shinohara and Setsuo Arikawa",

year = "1999",

doi = "10.1007/3-540-48452-3_3",

language = "English",

isbn = "3540662782",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "37--49",

editor = "Mike Paterson and Maxime Crochemore",

booktitle = "Combinatorial Pattern Matching - 10th Annual Symposium, CPM 1999, Proceedings",

note = "10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999 ; Conference date: 22-07-1999 Through 24-07-1999",

}