Librería: BGV Books LLC, Murray, KY, Estados Unidos de America
EUR 34,46
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Exact ISBN match. Immediate shipping. No funny business.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 44,06
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lakeside Books, Benton Harbor, MI, Estados Unidos de America
EUR 42,85
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books!
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 47,49
Cantidad disponible: 5 disponibles
Añadir al carritoPaperback or Softback. Condición: New. String Algorithms in C: Efficient Text Representation and Search. Book.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 49,13
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Original o primera edición
EUR 60,85
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2020. 1st ed. paperback. . . . . .
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 56,59
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 59,28
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 64,55
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 61,05
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 70,16
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 293 pages. 9.75x7.00x0.75 inches. In Stock.
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 76,26
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New. 2020. 1st ed. paperback. . . . . . Books ship from the US and Ireland.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 100,51
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Librería: preigu, Osnabrück, Alemania
EUR 63,80
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 53,89
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 69,54
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 304 pp. Englisch.
Librería: moluna, Greven, Alemania
EUR 56,35
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 102,68
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 102,15
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Idioma: Inglés
Publicado por Apress, Apress Aug 2020, 2020
ISBN 10: 148425919X ISBN 13: 9781484259191
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 69,54
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 LearnUse 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 algorithmProcess 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 searchesWho This Book Is ForThose with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 70,37
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.