Handbook of Exact String Matching Algorithms
Book information
Description
String matching is a very important subject in the wider domain of text processing. It consists of finding one,or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.
Similar books
Handbook of Exact String Matching Algorithms
2004 · DJVU
Handbook of Exact String Matching Algorithms
2004 · PDF
Algorithms on Strings
2007 · PDF
125 Problems in Text Algorithms
2021 · PDF
String processing and information retrieval : 28th international symposium, SPIRE 2021, Lille, France, October 4-6, 2021, proceedings
2021 · PDF
125 Problems in Text Algorithms: with Solutions
2021 · PDF
Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers
2013 · PDF
Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings
2009 · PDF