Read String Algorithms in C: Efficient Text Representation and Search

String Algorithms in C: Efficient Text Representation and Search

Thomas Mailund

4.9/5 (14373 ratings)

Description: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 LearnUse 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 searchesWho This Book Is ForThose with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with String Algorithms in C: Efficient Text Representation and Search. To get started finding String Algorithms in C: Efficient Text Representation and Search, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Pages: —

Format: PDF, EPUB & Kindle Edition

Publisher: —

Release: —

ISBN: 148425919X

Description: 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 LearnUse 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 searchesWho This Book Is ForThose with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with String Algorithms in C: Efficient Text Representation and Search. To get started finding String Algorithms in C: Efficient Text Representation and Search, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Special Offer | $0.00

Special Offer! | $0.00

String Algorithms in C: Efficient Text Representation and Search

String Algorithms in C: Efficient Text Representation and Search

More Books

Beginning Data Science in R: Data Analysis, Visualization, and Modelling for the Data Scientist by Thomas Mailund, Apress

Beginning Data Science in R: Data Analysis, Visualization, and Modelling for the Data Scientist by Thomas Mailund, Apress

The Beginner's Guide to Todoist

The Beginner's Guide to Todoist

The Beginner's Guide to GitHub

The Beginner's Guide to GitHub

Advanced Object-Oriented Programming in R: Statistical Programming for Data Science, Analysis and Finance

Advanced Object-Oriented Programming in R: Statistical Programming for Data Science, Analysis and Finance

Future Humans: What will humans look like in a million years?

Future Humans: What will humans look like in a million years?

Pointers in C Programming: A Modern Approach to Memory Management, Recursive Data Structures, Strings, and Arrays

Pointers in C Programming: A Modern Approach to Memory Management, Recursive Data Structures, Strings, and Arrays

The Joys of Hashing: Hash Table Programming with C

The Joys of Hashing: Hash Table Programming with C

Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More

Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More

The Beginner's Guide to Markdown and Pandoc

The Beginner's Guide to Markdown and Pandoc