Text Algorithms

Text Algorithms

A book on the design of algorithms and data structures for text processing, emphasizing both theoretical foundations and practical applications.

Publication date: 31 Dec 1994

ISBN-10: 0195086090

ISBN-13: n/a

Paperback: 412 pages

Views: 14,251

Type: N/A

Publisher: Oxford University Press

License: n/a

Post time: 20 Nov 2010 09:55:53

Text Algorithms

Text Algorithms A book on the design of algorithms and data structures for text processing, emphasizing both theoretical foundations and practical applications.
Tag(s): Algorithms and Data Structures
Publication date: 31 Dec 1994
ISBN-10: 0195086090
ISBN-13: n/a
Paperback: 412 pages
Views: 14,251
Document Type: N/A
Publisher: Oxford University Press
License: n/a
Post time: 20 Nov 2010 09:55:53
Excerpts from the Preface:
Maxime Crochemore wrote: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.

From the theoretical point of view, the book is a goldmine of paradigms for the development of efficient algorithms, providing the necessary foundation to creating practical software dealing with sequences. A crucial point in the authors' approach is the development of a methodology for presenting text algorithms so they can be fully understood. Throughout, the book emphasizes the efficiency of algorithms, holding that the essence of their usefulness depends on it. This is especially important since the algorithms described here will find application in "Big Science" areas like molecular sequence analysis where the explosive growth of data has caused problems for the current generation of software. Finally, with its development of theoretical background, the book can be considered as a mathematical foundation for the analysis and production of text processing algorithms.




About The Author(s)


Maxime Crochemore is a professor in the Department of Informatics at King's College London. Prof. Crochemore's research interests are in the design and analysis of algorithms. His major achievements are on string algorithms, which includes pattern matching, text indexing, coding, and text compression. He also works on the combinatorial background of these subjects and on their applications to bio-informatics. 

Maxime Crochemore

Maxime Crochemore is a professor in the Department of Informatics at King's College London. Prof. Crochemore's research interests are in the design and analysis of algorithms. His major achievements are on string algorithms, which includes pattern matching, text indexing, coding, and text compression. He also works on the combinatorial background of these subjects and on their applications to bio-informatics. 


Wojciech Rytter is a Polish computer scientist, a professor of computer science at the University of Warsaw. His research focuses on the design and analysis of algorithms, and in particular on stringology. 

Wojciech Rytter

Wojciech Rytter is a Polish computer scientist, a professor of computer science at the University of Warsaw. His research focuses on the design and analysis of algorithms, and in particular on stringology. 


Book Categories
Sponsors
Icons8, a free icon pack