College Publications logo   College Publications title  
View Basket
Homepage Contact page
   
 
AiML
Algorithmics
Cadernos de Lógica e Computação
Cadernos de Lógica e Filosofia
Cahiers de Logique et d'Epistemologie
Communication, Mind and Language
Computing
Cuadernos de lógica, Epistemología y Lenguaje
DEON
Dialogues
Economics
Encyclopaedia of Logic
Filosofia
Handbooks
IfColog series in Computational Logic
Journals
Law and Society
Logic PhDs
Logic, Methodology and Philosophy of Science
The Logica Yearbook
Neural Computing and Artificial Intelligence
Philosophy
Research
The SILFS series
Studies in Logic
Studies in Talmudic Logic
Systems
Texts in Mathematics
Tributes
Other
Digital Downloads
Information for authors
About us
Search for Books
 



Algorithmics


Back

Handbook of Exact String Matching Algorithms

Christian Charras, Thierry Lecroq

String matching is a very important subject in the wider domain of text processing. It consists in 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 its main features, a description, its C code, an example, and references.

19 October 2004

ISBN 0-9543006-4-5

Buy from Amazon: UK   US   






© 2005–2017 College Publications / VFH webmaster