Carte String Searching Algorithms Graham A. Stephen

String Searching Algorithms

Limbă: engleză
Legare: Carte broșată
Disponibilitate: șansă 50%
Şanse de a obține acest titlu
249.37 lei
String searching is a subject of both theoretical and practical interest in computer science. This i...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
1994
Pagini
256
EAN
9789810237035
Enbook ID
05066192
Greutate
349
Dimensiuni
317 x 220 x 14

Descriere completă

String searching is a subject of both theoretical and practical interest in computer science. This is a bibliographic overview of the field and an anthology of descriptions of the principal algorithms available. The aim is two-fold: on the one hand, to provide an easy-to-read comparison of the available techniques in each area; and on the other, to furnish the reader with a reference to in-depth descriptions of the major algorithms. Topics covered include methods for finding exact and approximate string matches, calculating "edit" distances between strings, finding common sequences and finding the longest repetitions within strings. For clarity, all the algorithms are presented in a uniform format and notation.

S-ar putea să te intereseze

553.26 lei
194.16 lei
69.67 lei
137.12 lei
158.96 lei
82.92 lei
314.60 lei
113.05 lei
44.89 lei

Clienții care au cumpărat această carte au mai cumpărat și

Olanda

Edmondo De Amicis
125.29 lei
109.51 lei
126.30 lei

Praha renesanční

Eliška Fučíková
64.21 lei
98.79 lei
259.49 lei
63.20 lei