String Algorithms in C

String Algorithms in C
Author :
Publisher : Apress
Total Pages :
Release :
ISBN-10 : 148425919X
ISBN-13 : 9781484259191
Rating : 4/5 (191 Downloads)

Book Synopsis String Algorithms in C by : Thomas Mailund

Download or read book String Algorithms in C written by Thomas Mailund and published by Apress. This book was released on 2020-11-12 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

String Algorithms in C Related Books

String Algorithms in C
Language: en
Pages:
Authors: Thomas Mailund
Categories: Computers
Type: BOOK - Published: 2020-11-12 - Publisher: Apress

GET EBOOK

Implement practical data structures and algorithms for text search and discover how it is used inside other larger applications. This unique in-depth guide expl
Algorithms on Strings
Language: en
Pages: 400
Authors: Maxime Crochemore
Categories: Computers
Type: BOOK - Published: 2007-04-09 - Publisher: Cambridge University Press

GET EBOOK

Detailed algorithms for string processes and pattern matching have examples from natural language processing, molecular sequencing, and databases.
Algorithms on Strings, Trees, and Sequences
Language: en
Pages: 556
Authors: Dan Gusfield
Categories: Computers
Type: BOOK - Published: 1997-05-28 - Publisher: Cambridge University Press

GET EBOOK

String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electro
Handbook of Exact String Matching Algorithms
Language: en
Pages: 238
Authors: Christian Charras
Categories: Computers
Type: BOOK - Published: 2004 - Publisher: College PressPub Company

GET EBOOK

String matching is a very important subject in the wider domain of text processing. It consists of finding one, or more generally, all the occurrences of a stri
Text Algorithms
Language: en
Pages: 396
Authors: Maxime Crochemore
Categories: Algorithms
Type: BOOK - Published: 1994 - Publisher: Maxime Crochemore

GET EBOOK

This much-needed book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It