String Algorithms in C

af


Studiebog
String Algorithms in C
Du sparer Spar kr. 25,00 med Shopping-fordele
  • Leveringstid 5-8 hverdage
  • Forventet levering 28-04-2021
For at købe bogen til fordelspris skal du have et medlemskab med Shopping-fordele. Du kan prøve medlemskabet gratis de første 30 dage. Medlemskabet fornyes automatisk og kan altid opsiges. Læs mere om medlemskaber og Shopping-fordele her.
Format:
Bog, paperback
Udgivelsesdato:
01-08-2020
Sprog:
Engelsk
Udgave:
1st ed..
  • Beskrivelse
  • Yderligere info
  • Anmeldelser

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.

Andre udgaver:

E-bog, ePub

Vis mereVis mindre

Udgivelsesdato:
01-08-2020
ISBN13:
9781484259191
Vægt:
581 g
Dybde:
16 mm
Bredde:
178 mm
Højde:
254 mm
Forlag:
Apress
Format:
Paperback
Forfattere

Vis mereVis mindre

Vis mereVis mindre

Fandt du ikke hvad du søgte?

Hvis denne bog ikke er noget for dig, kan du benytte kategorierne nedenfor til at finde andre titler. Klik på en kategori for at se lignende bøger.

Velkommen til Saxo – din danske boghandel!

Hos os kan du handle som gæst, Saxo-bruger eller Premium-medlem – du bestemmer helt selv. Skulle du få brug for hjælp, sidder vores kundeservice-team klar ved både telefonerne og tasterne.

Om fordelspriser hos Saxo

For at købe bøger til fordelspris, skal du være medlem af Premium, Premium Shopping eller Premium Studie. De første 30 dage er gratis for nye medlemmer. Medlemskabet fornyes automatisk og kan altid opsiges. Læs mere om fordelene ved vores forskellige medlemskaber her.

Machine Name: SAXO081