TY - GEN
T1 - Pattern matching in text compressed by using antidictionaries
AU - Shibata, Yusuke
AU - Takeda, Masayuki
AU - Shinohara, Ayumi
AU - Arikawa, Setsuo
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84957642924&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957642924&partnerID=8YFLogxK
U2 - 10.1007/3-540-48452-3_3
DO - 10.1007/3-540-48452-3_3
M3 - Conference contribution
AN - SCOPUS:84957642924
SN - 3540662782
SN - 9783540662785
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 37
EP - 49
BT - Combinatorial Pattern Matching - 10th Annual Symposium, CPM 1999, Proceedings
A2 - Paterson, Mike
A2 - Crochemore, Maxime
PB - Springer Verlag
T2 - 10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999
Y2 - 22 July 1999 through 24 July 1999
ER -