Anbieter: -OnTimeBooks-, Phoenix, AZ, USA
Zustand: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item for full refund. Ships USPS Media Mail.
Anbieter: BGV Books LLC, Murray, KY, USA
Zustand: Good. Exact ISBN match. Immediate shipping. No funny business.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 42,91
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 44,73
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 47,84
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: California Books, Miami, FL, USA
Zustand: New.
Anbieter: GoldBooks, Denver, CO, USA
Zustand: new.
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Paperback or Softback. Zustand: New. String Algorithms in C: Efficient Text Representation and Search. Book.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 54,40
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 60,04
Anzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 61,07
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 67,98
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 293 pages. 9.75x7.00x0.75 inches. In Stock.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 94,71
Anzahl: 1 verfügbar
In den WarenkorbZustand: New.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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.
Anbieter: moluna, Greven, Deutschland
EUR 56,35
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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.