**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 here:

**Download link**

(multiple formats)

## Similar books

**Matters Computational: Ideas, Algorithms, Source Code**

by

**Joerg Arndt**

This is a book for a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. We use the C++ programming language for low-level algorithms.

(

**7202**views)

**Sorting and Searching Algorithms: A Cookbook**

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.

(

**10061**views)

**Sequential and Parallel Sorting Algorithms**

by

**H. W. Lang**-

**FH Flensburg**

From the table of contents: insertion sort, quicksort, heapsort, mergesort, shellsort, lower bounds, external sorting, sorting networks, sorting on mesh-connected processor arrays, sorting contest. Explanations are followed by source code.

(

**9366**views)

**Algorithms for Programmers: Ideas and Source Code**

by

**Jorg Arndt**

Aimed to programmers who are interested in the selected algorithms and those who want to create optimized code. It covers low level algorithms, combinatorial generation, fast orthogonal transforms, fast arithmetic, and algorithms for finite fields.

(

**10283**views)