Handbook of Exact String Matching Algorithms (Texts on Algorithms 1)
Christian Charras, Thierry Lecroq
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.
Categories:
Volume:
1
Year:
2004
Edition:
1st
Publisher:
Parlux
Language:
english
Pages:
238
ISBN 10:
0954300645
ISBN 13:
9780954300647
Series:
Texts on Algorithms
File:
PDF, 713 KB
IPFS:
,
english, 2004
Amazon 
Barnes & Noble 
Bookshop.org 
File converter
More search results
More benefits 
Most frequently terms
Related Booklists
