Time-Efficient String Matching Algorithms and the Brute-Force Method

Lina Lumburovska (2018) Time-Efficient String Matching Algorithms and the Brute-Force Method. EngD thesis.

Preview

PDF Download (896Kb)

Abstract

One of the most researched areas of computer science is the string matching problem. In everyday life, people read, write, and encounter character strings all the time. Very often they want to find substrings (e.g. words) that match parts of the original text and have higher probability of matching. Finding a new efficient algorithm for the String Matching Problem involves a tremendous number of testing, just to slightly improve on the existing algorithms. In this, the algorithm based on the Brute-Force Method is of considerable help, as many current algorithms are founded on it. My bachelor thesis explores different algorithms for the String Matching Problem and comes to a conclusion that each such algorithm has advantages and disadvantages, and is suitable for solving a particular version of the String Matching Problem and type of situations. Nevertheless, the most used algorithm in practice is the Knuth-Morris-Pratt algorithm

Actions (login required)