String Algorithms Efficient Text by Mailund Thomas (17 results)
- Softcover
Seller: BGV Books LLC, Murray, KY, U.S.A.BGV Books LLC
Contact seller5-star sellerCondition: Used - Good
US$ 38.20
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: Good. Exact ISBN match. Immediate shipping. No funny business.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 48.84
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contact seller5-star sellerCondition: New
US$ 52.65
Free ShippingShips within U.S.A.Quantity: 5 available
Paperback or Softback. Condition: New. String Algorithms in C: Efficient Text Representation and Search. Book.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 54.47
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
- First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
US$ 71.84
US$ 12.04 shippingShips from Ireland to U.S.A.Quantity: 15 available
Condition: New. 2020. 1st ed. paperback. . . . . .
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 64.24
US$ 19.81 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 66.59
US$ 19.81 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 73.46
US$ 15.82 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, , United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 69.47
US$ 20.46 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
- Softcover
Seller: Revaluation Books, Exeter, , United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 79.51
US$ 16.51 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. 293 pages. 9.75x7.00x0.75 inches. In Stock.
- Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
US$ 84.55
US$ 10.50 shippingShips within U.S.A.Quantity: 15 available
Condition: New. 2020. 1st ed. paperback. . . . . . Books ship from the US and Ireland.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 110.49
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 75.32
US$ 80.23 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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[d…ot]com | Anbieter: preigu.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, , United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 111.80
US$ 8.58 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: moluna, Greven, , Germanymoluna
Contact seller5-star sellerCondition: New
US$ 66.53
US$ 56.15 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 116.66
US$ 11.40 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 83.08
US$ 72.07 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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.
