String Algorithms in C: Efficient Text Representation and Search
by Thomas Mailund
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Turn this order into a program
Groups that order in bulk often pair the copies with something more. We handle the extras so you don't have to.
One address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment options Pair it with a branded journalJournals with your logo or each reader's name, for the same group.
Branded journals
Bring in a speaker
BookPal is partnering with Talezo to help you find and book authors, speakers and performers for your event.
BookPal × TalezoString Algorithms in C
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.
The book, String Algorithms in C: Efficient Text Representation and Search [Bulk, Wholesale, Quantity] ISBN#9781484259191 in Paperback by Thomas Mailund may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
- Publisher
- Apress
- Author
- Thomas Mailund
- Format
- Paperback
- Published
- Aug 29, 2020
- ISBN-13
- 9781484259191
- Pages
- 293
- Printing
- Printed on demand
String Algorithms in C in bulk: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 99 | $48.99 | 30% off list |
| 100 – 249 | $47.59 | 32% off list |
| 250 – 499 | $46.19 | 34% off list |
| 500 – 999 | $44.79 | 36% off list |
| 1,000+ | $43.39 | 38% off list |
Popular for
A copy for every member, on one order.
A book for every attendee, delivered to your venue.
For clients, staff, members or volunteers.
How fast can I get copies of String Algorithms in C?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship in bulk to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other bulk booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
What buyers say
Write a Review
String Algorithms in C: Efficient Text Representation and Search [9781484259191]
Groups also order
A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.