Menu
Zistiť stav objednávky
Kontaktujte nás
Kniha String Algorithms in C Thomas Mailund

String Algorithms in C

Efficient Text Representation and Search

Autor: Thomas Mailund
Jazyk: Angličtina
Väzba: Brožovaná
Vydavateľ: APress
Dostupnosť: Skladom u dodávateľa
Odosielame za 9-15 dní
47.79 €
Implement practical data structures and algorithms for text search and discover how it is used insid...

Informácie o knihe

Autor
Thomas Mailund
Jazyk
Angličtina
Väzba
Kniha - Brožovaná
Vydalo
2020
Stránok
293
EAN
9781484259191
Enbook ID
28286530
Vydavateľ
APress
Hmotnosť
581
Rozmery
178 x 254 x 17

Kompletný popis

Implement practical data structures and algorithms for text search and discover how it is used inside other larger applications. This unique in-depth guide explains string algorithms using the C programming language. String Algorithms in C teaches you the following algorithms and how to use them: classical exact search algorithms; tries and compact tries; suffix trees and arrays; approximative pattern searches; and more. In this book, author Thomas Mailund provides a library with all the algorithms and applicable source code that you can use in your own programs. There are implementations of all the algorithms presented in this book so there are plenty of examples. You'll understand that string algorithms are used in various applications such as image processing, computer vision, text analytics processing from data science to web applications, information retrieval from databases, network security, and much more. What You Will Learn Use classical exact search algorithms including naive search, borders/border search, Knuth-Morris-Pratt, and Boyer-Moor with or without Horspool Search in trees, use tries and compact tries, and work with the Aho-Carasick algorithm Process suffix trees including the use and development of McCreight's algorithm Work with suffix arrays including binary searches; sorting naive constructions; suffix tree construction; skew algorithms; and the Borrows-Wheeler transform (BWT) Deal with enhanced suffix arrays including longest common prefix (LCP) Carry out approximative pattern searches among suffix trees and approximative BWT searches Who This Book Is For Those with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.

Mohlo by vás zaujímať

Introducing Algorithms in C

Luciano Manelli
31.10 €

Algorithms in C, Parts 1-5

Robert Sedgewick
128.85 €

C Programming

K N King
86.26 €

Modern C

Jens Gustedt
63.00 €

End of Watch

Stephen King
22.07 €

Applied Cryptography - Protocols, Algorithms and Source Code in C 20th Anniversary Edition

Bruce Schneier
49.75 €

Scientific Programming: C-language, Algorithms And Models In Science

Luciano M. Barone
252.61 €

Anarchipelago

Jay Griffiths
7.25 €

MESSAGE FROM THE PRESIDENT OF

United States Dept of State
13.44 €

But First I Caught a Monster

Tjibbe Veldkamp
10.39 €

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

Pax. La nena fantasma : Pax 3

ASA LARSSON
15.01 €

Programación matemática

Juan José Salazar González
40.92 €

Mein Budget - Leaves Edition

havicaro
20.01 €

Hotel Paris

Hans-Ingo Radatz
21.78 €