Bookbot

Handbook of Exact String Matching Algorithms

Ocena książki

Parametry

  • 256 stron
  • 9 godzin czytania

Więcej o książce

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.

Zakup książki

Handbook of Exact String Matching Algorithms, Christian Charras, Thierry Lecroq

Język
Rok wydania
2004
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

4,4
Bardzo dobra
3 Ocena

Brakuje nam tutaj Twojej recenzji.

Tytuł
Handbook of Exact String Matching Algorithms
Język
angielski
Rok wydania
2004
Oprawa
miękka
Liczba stron
256
ISBN10
0954300645
ISBN13
9780954300647
Seria
Tagi
Ocena
4,35 z 5
Opis
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.