Text Algorithms [Hardcover]

Maxime Crochemore (Author), Wojciech Rytter (Author)

Book Description

Publication Date: October 20, 1994 | ISBN-10: 0195086090 | ISBN-13: 978-0195086096

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.

Editorial Reviews

Review

"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."--Mathematical Reviews

"Given the practical importance of this fast-moving subject, serious students of computer science will be grateful for this authoritative treatment of both the basics and late-breaking developments....The plethora of illuminating diagrams is a saving grace."--Choice

Product Details

• Hardcover: 432 pages
• Publisher: Oxford University Press, USA (October 20, 1994)
• Language: English
• ISBN-10: 0195086090
• ISBN-13: 978-0195086096
• Product Dimensions: 9.6 x 6.3 x 1 inches
• Shipping Weight: 1.7 pounds
• Amazon Best Sellers Rank: #2,618,009 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.