Text Algorithms
by M. Crochemore, W. Rytter
Publisher: Oxford University Press 1994
ISBN/ASIN: 0195086090
ISBN-13: 9780195086096
Number of pages: 412
Description:
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.
Download or read it online for free here:
Download link
(multiple formats)
Similar books

- Wikibooks
This book shows how common algorithms are written in various programming languages, providing code implementations and explanation. Topics: Checksums; Date and time; Graphs; Hashing; Optimization; Search; Simulation; Sorting; String searching; etc.
(13885 views)

by Ahmed Shamsul Arefin - Gyankosh Prokashoni
Textbook for an algorithm course focusing on programming as well as a programming course focusing on algorithms. The book is specially designed to train students to participate in competitions - the ACM International Collegiate Programming Contest.
(18160 views)

- Goalkicker.com
Contents: Algorithm Complexity; Big-O Notation; Trees; Binary Search Trees; Graph; Dijkstra's Algorithm; A* Pathfinding; Dynamic Programming; Kruskal's Algorithm; Greedy Algorithms; Catalan Number; Sorting; Searching; Pascal's Triangle; etc.
(3325 views)

by Thomas Niemann
Collection of algorithms for sorting and searching, and techniques for implementing dictionaries, with brief and intuitive descriptions. It is assumed that you know C, and that you are familiar with concepts such as arrays and pointers.
(14630 views)