By Topic

Effects of Suffix Repetition Rates of a String on the Performance of String Matching Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yang Wang ; Comput. Sci. Dept., Missouri State Univ., Springfield, MO, USA

The highly efficient Boyer-Moore's string matching algorithm utilizes information on multi-occurrences of string suffixes in a pattern string to avoid backtracks in searching the pattern string. One hypothesis is that Boyer-Moore's algorithm even benefits more from highly self-repetitive patterns. In this paper, the author studies how multi-occurrences of string suffixes affect the performance of the Boyer-Moore's algorithm as well as some other well known string search algorithms. The paper introduces a new concept of suffix repetition rate (SRR) to measure how frequently the suffixes of a string occur inside of the string. Using this measurement, experiments with several thousands patterns over the entire range of SRRs have been carried out, and the results show that increasing of SRR on pattern strings does not improve the performance of a searching algorithm in terms of efficiency.

Published in:

Computer and Information Science, 2009. ICIS 2009. Eighth IEEE/ACIS International Conference on

Date of Conference:

1-3 June 2009