Kniha String Searching Algorithms Graham A. Stephen

String Searching Algorithms

Jazyk: Angličtina
Väzba: Brožovaná
Dostupnosť: 50 % šanca
Prehľadáme celý svet
45.48
String searching is a subject of both theoretical and practical interest in computer science. This i...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Brožovaná
Vydalo
1994
Stránok
256
EAN
9789810237035
Enbook ID
05066192
Hmotnosť
349
Rozmery
317 x 220 x 14

Kompletný popis

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.

Mohlo by vás zaujímať

100.00
33.59
11.98
23.57
27.50
15.12
54.61
21.51
8.14

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Olanda

Edmondo De Amicis
22.59
20.82
24.06

Praha renesanční

Eliška Fučíková
13.92
17.77
46.95
11.39