@inproceedings{8bb932f3c50e40f68eb707c722969607,
title = "Solution of skip distance constraint on sub-linear time string-matching architecture",
abstract = "Pre-filters are well-known techniques used to speed up string-matching process. The skip-based pre-filters make it possible to achieve sub-linear time complexity. However, they have a common constraint that their skip distances are bounded by the shortest keyword length. If the shortest keyword length is small, then this constraint will be a bottleneck problem in string-matching throughput. This paper provides a solution that the skip distance can be longer than the shortest keyword length. Also, a matching strategy based on the solution is proposed. This strategy can not only solve the bottleneck problem, but also reduce the operations in the sub-linear time string-matching procedure.",
keywords = "pre-filter, skip distance, string matching, sub-linear time, verification",
author = "Huang, {Nai Lun} and Tsern-Huei Lee and Tseng, {Kuo Kun}",
year = "2013",
month = dec,
day = "1",
doi = "10.1109/TENCON.2013.6718990",
language = "English",
isbn = "9781479928262",
series = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",
booktitle = "2013 IEEE International Conference of IEEE Region 10, IEEE TENCON 2013 - Conference Proceedings",
note = "null ; Conference date: 22-10-2013 Through 25-10-2013",
}