Kniha String Searching Algorithms Graham A. Stephen

String Searching Algorithms

Jazyk: Angličtina
Vazba: Brožovaná
Dostupnost: 50 % šance
Prohledáme celý svět
1 049
String searching is a subject of both theoretical and practical interest in computer science. This i...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
1994
Stránek
256
EAN
9789810237035
Enbook ID
05066192
Hmotnost
349
Rozměry
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 zajímat

2 286
812
290
570
664
347
1 321
188

Zákaznicí kteří koupili tuto knihu koupili také

Olanda

Edmondo De Amicis
516
504
582

Praha renesanční

Eliška Fučíková
292
404
1 072
259