Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- 作者：Djamal Belazzougui1
- 关键词：Independent set ; Fixed-parameter tractability ; Hereditary class of graphs ; Modular decomposition
- 刊名：Journal of Discrete Algorithms
- 出版年：2012
- 期刊代码：10_15708667
- 类别：mt
- 出版时间：July, 2012
- 卷：14
- 期：Complete
- 页码：91-106
- 文件大小：286 K
摘要
In this paper, we explore worst-case solutions for the problems of single and multiple matching on strings in the word-RAM model with word length w. In the first problem, we have to build a data structure based on a pattern p of length m over an alphabet of size 蟽 such that we can answer to the following query: given a text T of length n, where each character is encoded using log 蟽 bits return the positions of all the occurrences of p in T (in the following we refer by occ to the number of reported occurrences). For the multi-pattern matching problem we have a set S of d patterns of total length m and a query on a text T consists in finding all positions of all occurrences in T of the patterns in S. As each character of the text is encoded using log 蟽 bits and we can read w bits in constant time in the RAM model, we assume that we can read up to consecutive characters of the text in one time step. This implies that the fastest possible query time for both problems is . In this paper we present several different results for both problems which come close to that best possible query time. We first present two different linear space data structures for the first and second problem: the first one answers to single pattern matching queries in time while the second one answers to multiple pattern matching queries to where y is the length of the shortest pattern. We then show how a simple application of the four Russian technique permits to get data structures with query times independent of the length of the shortest pattern (the length of the only pattern in case of single string matching) at the expense of using more space.