Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
String Matching Algorithms, Study notes of Design and Analysis of Algorithms
Different algorithms for solving the string matching problem, which consists of finding a pattern within a text. The algorithms discussed are the Naive Algorithm, the Rabin-Karp Algorithm, and the Knuth-Morris-Pratt (KMP) Algorithm. The KMP Algorithm is a linear algorithm that works on preprocessed tables. The document also briefly mentions the Vertex Cover Problem and the Activity Selection Problem. examples and pseudocode for the algorithms presented.
Typology: Study notes
2022/2023
1 / 16
This page cannot be seen from the preview
Don't miss anything!