Da: BGV Books LLC, Murray, KY, U.S.A.
Condizione: Good. Exact ISBN match. Immediate shipping. No funny business.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 43,28
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condizione: New. String Algorithms in C: Efficient Text Representation and Search. Book.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 48,26
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 55,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 58,24
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 63,31
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 60,31
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Revaluation Books, Exeter, Regno Unito
EUR 67,85
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 293 pages. 9.75x7.00x0.75 inches. In Stock.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New.
EUR 63,80
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. String Algorithms in C | Efficient Text Representation and Search | Thomas Mailund | Taschenbuch | ix | Englisch | 2020 | Apress | EAN 9781484259191 | Verantwortliche Person für die EU: APress in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: Majestic Books, Hounslow, Regno Unito
EUR 98,81
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Da: moluna, Greven, Germania
EUR 56,35
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Focuses exclusively on string algorithms using C Written by an an expert, computational scientist, and teacher with expertise in C and R Contains implementations of all the algorithms presented in this b.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 100,05
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 70,37
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Implement practical data structures and algorithms for text searchand 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 ForThose with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.