125 Problems in Text Algorithms

Name: 125 Problems in Text Algorithms
SKU: 35200151
Price: 111.99 AUD
Availability: InStock

with Solutions

By:

Format:

Paperback / softback

Show Hide Adult Content

$111.99

Available from supplier

Usually ships in 2-3 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

4 payments of $28.00 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

Around 28 Jun - 10 Jul using International Courier

Description

String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods).

Author Biography:

Maxime Crochemore is Emeritus Professor of Université 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.

Release date Australia

July 1st, 2021

Author

Audience

Professional & Vocational

Illustrations

Worked examples or Exercises

Pages

344

Dimensions

150x227x19

ISBN-13

9781108798853

Product ID

35200151

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here