如果非得用suffix tree,能不能转化成exact set matching? "www.i" occurs at index X = {x1, x2...} "a" occurs at index Y = {y1, y2...} "c.com" occurs at index Z = {z1, z2...} Building the suffix tree and matching can be done in linear time. Then, pattern occurs in text iff the following has solution: y-x >= 5 z-y >= 1 x, y, z from X, Y, Z 不知道这方程组有没有线性解法。
谢谢,我以前见过这paper,还有Yates and Gonnet那篇,好长啊。。 能否简单说一下它的中心思想是什么?
Engine. a
【在 s*********l 的大作中提到】 : This paper : Junghoo Cho, Sridhar Rajagopalan: A Fast Regular Expression Indexing Engine. : ICDE 2002: 419-430 : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.18.6659&rep=rep1&type=pdf : addresses scale and performance issues when matching regular expressions (a : regex) against a large corpus. : : efficiently