Skip to content

Text Algorithms

Best in textbook rentals since 2012!

ISBN-10: 0195086090

ISBN-13: 9780195086096

Edition: 1994

Authors: Maxime Crochemore, Wojciech Rytter

List price: $135.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
We're sorry. This item is currently unavailable.
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

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…    
Customers also bought

Book details

List price: $135.00
Copyright year: 1994
Publisher: Oxford University Press, Incorporated
Publication date: 10/20/1994
Binding: Hardcover
Pages: 432
Size: 6.31" wide x 9.56" long x 1.00" tall
Weight: 1.672

Professor Maxime Crochemore received his PhD in 1978 and his Doctorat d'etat in 1983 at the University of Rouen. He got his first professorship position at the University of Paris-Nord in 1975 where he acted as President of the Department of Mathematics and Computer Science for two years. He became professor at the University Paris 7 in 1989 and was involved in the creation of the University of Marne-la-Vallee where he is presently Professor. He also created the Computer Science research laboratory of this university in 1991, which has now more than fifty permanent researchers. He was the director of the laboratory until 2005. Professor Crochemore is Senior Research Fellow at King's College…    

Rytter, Institute of Informatics, Warsaw University.

Introduction
Foundations
Basic String-Matching Algorithms
The Boyer-Moore Algorithm and its Variations
Suffix Trees
Subword Graphs
Automata-Theoretic Approach
Regularities in Texts: Symmetries and Repetitions
Almost Optimal Parallel Algorithms
Text Compression Techniques
Approximate Pattern Matching
Two-Dimensional Pattern Matching
Time-Space Optimal String Matching
Time-Processors Optimal String Matching
Miscellaneous
Table of Contents provided by Publisher. All Rights Reserved.