A Fast String Matching Algorithm Based on Lowlight Characters in the Pattern
Data Structures and Algorithms
2014-01-29 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1401.7110,
title = {A Fast String Matching Algorithm Based on Lowlight Characters in the Pattern},
author = {Zhengjun Cao and Lihua Liu},
journal= {arXiv preprint arXiv:1401.7110},
year = {2014}
}