Menu
Sprawdź status swojego zamówienia
Skontaktuj się z nami
Książka String Algorithms in C Thomas Mailund

String Algorithms in C

Efficient Text Representation and Search

Autor: Thomas Mailund
Język: Angielski
Oprawa: Miękka
Wydawca: APress
Dostępność: Dostępna u dostawcy
Wysyłamy za 9-15 dni
215.87 zł
Implement practical data structures and algorithms for text search and discover how it is used insid...

Informacje o książce

Autor
Thomas Mailund
Język
Angielski
Oprawa
Książka - Miękka
Data wydania
2020
strony
293
EAN
9781484259191
Enbook ID
28286530
Wydawca
APress
Waga
581
Wymiary
178 x 254 x 17

Pełny opis

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.

Możesz być zainteresowany

Introducing Algorithms in C

Luciano Manelli
140.40 zł

Algorithms in C, Parts 1-5

Robert Sedgewick
546.26 zł

C Programming

K N King
365.73 zł

Modern C

Jens Gustedt
268.16 zł

End of Watch

Stephen King
99.90 zł

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

Bruce Schneier
224.83 zł

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

Luciano M. Barone
1 120.08 zł

Anarchipelago

Jay Griffiths
30.95 zł

MESSAGE FROM THE PRESIDENT OF

United States Dept of State
59.97 zł

But First I Caught a Monster

Tjibbe Veldkamp
44.20 zł

Klienci, którzy kupili tę książkę, kupili również

Pax. La nena fantasma : Pax 3

ASA LARSSON
63.58 zł

Programación matemática

Juan José Salazar González
173.32 zł

Mein Budget - Leaves Edition

havicaro
85.00 zł

Hotel Paris

Hans-Ingo Radatz
92.50 zł