2014/01/28 by Zhengjun Cao, Lihua Liu, Cao, Zhengjun +1
Computer Science · #Algorithms and Data Compression #Network Packet Processing and Optimization #Web Data Mining and Analysis #cs.DS
paper · pdf · doi:10.48550/arxiv.1401.7110
arxiv created 2014/01/28 · arxiv updated 2014/01/29
We put forth a new string matching algorithm which matches the pattern from neither the left nor the right end, instead a special position. Comparing with the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm, the new algorithm is more flexible to pick the position for starting comparisons. The option really brings it a saving in cost.