Authors:
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 book
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (6 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Authors and Affiliations
-
Aarhus N, Denmark
Thomas Mailund
About the author
Bibliographic Information
Book Title: String Algorithms in C
Book Subtitle: Efficient Text Representation and Search
Authors: Thomas Mailund
DOI: https://doi.org/10.1007/978-1-4842-5920-7
Publisher: Apress Berkeley, CA
eBook Packages: Professional and Applied Computing, Professional and Applied Computing (R0), Apress Access Books
Copyright Information: Thomas Mailund 2020
Softcover ISBN: 978-1-4842-5919-1Published: 29 August 2020
eBook ISBN: 978-1-4842-5920-7Published: 28 August 2020
Edition Number: 1
Number of Pages: IX, 293
Number of Illustrations: 89 b/w illustrations
Topics: Programming Languages, Compilers, Interpreters, Algorithm Analysis and Problem Complexity, Algorithms