- Category: Computer
- Author: Maxime Crochemore and Wojciech Rytter
- Pages: 432 pages
- File type: PDF, ePub, Kindle, etc.
Read and download free eBook intituled Text Algorithms in format PDF, ePub, Kindle, etc. – 432 pages created by Maxime Crochemore and Wojciech Rytter.
It is very convenient to have this book at hand. It is the first book that systematically presents the results of work on practical and theoretical algorithmic problems on texts up to the most recent developments in stringology.
This much-needed book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It is intended to serve both as a textbook for courses on algorithm design, especially those related to text processing, and as a reference for computer science professionals. The work takes a unique approach, one that goes more deeply into its topic than other more general books. It contains both classical algorithms and recent results of research on the subject.
The book is the first text to contain a collection of a wide range of text algorithms, many of them quite new and appearing here for the first time. Other algorithms, while known by reputation, have never been published in the journal literature. Two such important algorithms are those of Karp, Miller and Rosenberg, and that of Weiner. Here they are presented together for the fist time. The core of the book is the material on suffix trees and subword graphs, applications of these data structures, new approaches to time-space optimal string-matching, and text compression. Also covered are basic parallel algorithms for text problems. Applications of all these algorithms are given for problems involving data retrieval systems, treatment of natural languages, investigation of genomes, data compression software, and text processing tools.
Read and Download Links: