String Matching Algorithms
There are many popular string matching algorithms. String matching algorithms have very important applications, such as searching for an element in a text document, plagiarism detection, text editing programs, and so on. In this chapter, we will study the pattern matching algorithms that find the locations of a given pattern or substring in any given text. We will discuss the brute force algorithm, along with the Rabin-Karp, Knuth-Morris-Pratt (KMP), and Boyer-Moore pattern matching algorithms. This chapter aims to discuss algorithms that are related to strings. The following topics will be covered in this chapter:
- Learning pattern matching algorithms and their implementation
- Understanding and implementing the Rabin-Karp pattern matching algorithm
- Understanding and implementing the Knuth-Morris-Pratt (KMP) algorithm
- Understanding and implementing the Boyer-Moore pattern matching algorithm
