We use cookies to provide essential features and services. By using our website you agree to our use of cookies .

×

Warehouse Stock Clearance Sale

Grab a bargain today!

125 Problems in Text Algorithms
By

Rating

Product Description
Product Details

Table of Contents

1. The Very Basics of Stringology; 2. Combinatorial Puzzles; 3. Pattern Matching; 4. Efficient Data Structures; 5. Regularities in Words; 6. Text Compression; 7. Miscellaneous.

Promotional Information

Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.

About the Author

Maxime Crochemore is Emeritus Professor of Universite Gustave-Eiffel and of King's College London. He holds an Honorary Doctorate from the University of Helsinki. He is the author of more than 200 articles on algorithms on strings and their applications, and co-author of several books on the subject. Thierry Lecroq is Professor in the Department of Computer Science at the University of Rouen Normandy (France). He is currently head of the research team 'Information Processing in Biology and Health' of the 'Laboratory of Computer Science, Information Processing and System'. He has been one of the coordinator of the working group in Stringology of the French CNRS for more than 10 years. Wojciech Rytter is Professor of University of Warsaw. He is the author of a large number of publications on automata, formal languages, parallel algorithms and algorithms on texts. He is a co-author of several books on these subjects, including 'Efficient Parallel Algorithms', 'Text Algorithms' and 'Analysis of algorithms and data structures'. He is a member of Academia Europaea.

Ask a Question About this Product More...
Write your question below:
Look for similar items by category
Home » Books » Computers » General
Home » Books » Computers » Programming » General
People also searched for
Item ships from and is sold by Fishpond World Ltd.
Back to top