String Searching Algorithms
Graham A Stephen
okt 1994. · Lecture Notes Series On Computing 3. knjiga · World Scientific
E-knjiga
256
Broj stranica
family_home
Prihvatljiva
info
reportOcjene i recenzije nisu potvrđene Saznajte više
O ovoj e-knjizi
String searching is a subject of both theoretical and practical interest in computer science. This book presents a bibliographic overview of the field and an anthology of detailed descriptions of the principal algorithms available. The aim is twofold: 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.
Ocijenite ovu e-knjigu
Recite nam šta mislite.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play Knjige za Android i iPad/iPhone uređaje. Aplikacija se automatski sinhronizira s vašim računom i omogućava vam čitanje na mreži ili van nje gdje god da se nalazite.
Laptopi i računari
Audio knjige koje su kupljene na Google Playu možete slušati pomoću web preglednika na vašem računaru.
Elektronički čitači i ostali uređaji
Da čitate na e-ink uređajima kao što su Kobo e-čitači, morat ćete preuzeti fajl i prenijeti ga na uređaj. Pratite detaljne upute Centra za pomoć da prenesete fajlove na podržane e-čitače.
