Menu
Rendelés állapotának ellenőrzése
Kapcsolat
Könyv String Algorithms in C Thomas Mailund

String Algorithms in C

Efficient Text Representation and Search

Szerző: Thomas Mailund
Nyelv: Angol
Kötés: Puha kötésű
Kiadó: APress
Elérhetőség: Beszállítói készleten
Küldés 9-15 napon belül
19 881 Ft
Implement practical data structures and algorithms for text search and discover how it is used insid...

Információk a könyvről

Szerző
Thomas Mailund
Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2020
oldal
293
EAN
9781484259191
Enbook ID
28286530
Kiadó
APress
Súly
581
Méretek
178 x 254 x 17

Teljes leírás

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.

Érdekelheti

Introducing Algorithms in C

Luciano Manelli
12 938 Ft

Algorithms in C, Parts 1-5

Robert Sedgewick
49 056 Ft

C Programming

K N King
30 625 Ft

Modern C

Jens Gustedt
23 637 Ft

End of Watch

Stephen King
8 697 Ft

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

Bruce Schneier
19 553 Ft

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

Luciano M. Barone
100 428 Ft

Anarchipelago

Jay Griffiths
2 746 Ft

MESSAGE FROM THE PRESIDENT OF

United States Dept of State
5 421 Ft

But First I Caught a Monster

Tjibbe Veldkamp
3 958 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Pax. La nena fantasma : Pax 3

ASA LARSSON
5 323 Ft

Programación matemática

Juan José Salazar González
14 518 Ft

Mein Budget - Leaves Edition

havicaro
7 786 Ft

Hotel Paris

Hans-Ingo Radatz
8 469 Ft