Space lower bounds for online pattern matching
Space lower bounds for online pattern matching
复制标题
在线模式匹配的空间下界
DOI：
10.1016/j.tcs.2012.06.012
复制
发表时间：
2013
影响因子：
1.1
通讯作者：
Clifford R
中科院分区：
文献类型：
--
作者：
Clifford R
给出了几种不同距离测度下在线模式匹配的空间下界。给定长度为m的模式和每次到达一个字符的文本，在线模式匹配问题是在新字符到达时立即报告模式与文本滑动窗口之间的距离。我们要求在每个位置以恒定的概率给出正确答案。我们给出了L1， L2, L∞,Hamming，编辑和交换距离以及计算相互关联/卷积的任何算法的Ω(m)位空间下界。然后，我们展示了具有类似通配符属性的距离函数和不具有通配符属性的距离函数之间的二分法。在前一种情况下，作为一个例子，包括与字符类的模式匹配，我们给出Ω(m)位空间下界。对于其他距离函数，我们证明存在Ω（logm）和O（log2m）位的空间边界。最后，我们讨论了非二进制输入的空间下界，并展示了在某些情况下如何改进它们。
We present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time, the online pattern matching problem is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. We require that the correct answer is given at each position with constant probability. We give Ω(m) bit space lower bounds for L1, L2, L∞, Hamming, edit and swap distances as well as for any algorithm that computes the cross-correlation/convolution. We then show a dichotomy between distance functions that have wildcard-like properties and those that do not. In the former case which includes, as an example, pattern matching with character classes, we give Ω(m) bit space lower bounds. For other distance functions, we show that there exist space bounds of Ω(logm) and O(log2m) bits. Finally we discuss space lower bounds for non-binary inputs and show how in some cases they can be improved.
一般匹配关系下的字符串匹配
影响因子：
1.1
作者：
S. Muthukrishnan;H. Ramesh
通讯作者：
H. Ramesh
影响因子：
0.5
作者：
Huang, Wei;Shi, Yaoyun;Zhu, Yufan
通讯作者：
Zhu, Yufan