0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming > Programming languages

Buy Now

String Algorithms in C - Efficient Text Representation and Search (Paperback, 1st ed.) Loot Price: R1,294
Discovery Miles 12 940
You Save: R350 (21%)
String Algorithms in C - Efficient Text Representation and Search (Paperback, 1st ed.): Thomas Mailund

String Algorithms in C - Efficient Text Representation and Search (Paperback, 1st ed.)

Thomas Mailund

 (sign in to rate)
List price R1,644 Loot Price R1,294 Discovery Miles 12 940 | Repayment Terms: R121 pm x 12* You Save R350 (21%)

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Apress
Country of origin: United States
Release date: August 2020
First published: 2020
Authors: Thomas Mailund
Dimensions: 254 x 178mm (L x W)
Format: Paperback
Pages: 293
Edition: 1st ed.
ISBN-13: 978-1-4842-5919-1
Categories: Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Computer programming > Programming languages > General
LSN: 1-4842-5919-X
Barcode: 9781484259191

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners