Text Algorithms | Computer Science, String Matching

Comprehensive book on text algorithms and data structures for text processing and string matching. Valuable resource for computer science students and researchers.

Introduction

Text Algorithms is a comprehensive book by Maxime Crochemore and Wojciech Rytter that covers the algorithms and data structures used in text processing and string matching. It is a valuable resource for computer science students and researchers interested in text algorithms.

Highlights

• Covers a wide range of text algorithms and data structures
• Focuses on the fundamental problem of pattern matching
• Includes variations on the string-matching problem, problems related to the structure of text segments, data compression, approximation problems, and more
• Discusses optimal time-space and parallel implementations

Recommendation

This book is highly recommended for computer science students and researchers interested in text processing and string matching algorithms. It provides a thorough and practical understanding of the field, making it a valuable resource for both academic and industry applications.