Menu
Zjistit 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
Vazba: Brožovaná
Vydavatel: APress
Dostupnost: Skladem u dodavatele
Odesíláme za 9-15 dnů
1 155 Kč
Implement practical data structures and algorithms for text search and discover how it is used insid...

Informace o knize

Autor
Thomas Mailund
Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2020
Stránek
293
EAN
9781484259191
Enbook ID
28286530
Vydavatel
APress
Hmotnost
581
Rozměry
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 zajímat

Introducing Algorithms in C

Luciano Manelli
752 Kč

Algorithms in C, Parts 1-5

Robert Sedgewick
2 976 Kč

C Programming

K N King
1 897 Kč

Modern C

Jens Gustedt
1 370 Kč

End of Watch

Stephen King
497 Kč

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

Bruce Schneier
1 121 Kč

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

Luciano M. Barone
6 110 Kč

Anarchipelago

Jay Griffiths
166 Kč

MESSAGE FROM THE PRESIDENT OF

United States Dept of State
326 Kč

But First I Caught a Monster

Tjibbe Veldkamp
236 Kč

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

Pax. La nena fantasma : Pax 3

ASA LARSSON
363 Kč

Programación matemática

Juan José Salazar González
989 Kč

Mein Budget - Leaves Edition

havicaro
457 Kč

Hotel Paris

Hans-Ingo Radatz
497 Kč