{"product_id":"125-problems-in-text-algorithms-with-solutions-1","title":"125 Problems in Text Algorithms: with Solutions","description":"\u003cp\u003e\u003c\/p\u003e\u003cblockquote\u003e\n\u003cbr\u003eString matching is an old algorithmic technique that has seen technological leaps in the past 20 years, from information retrieval to compression. This book offers puzzles and exercises to help graduate students and researchers learn and practice advanced concepts in text algorithms and combinatorics. The problems are drawn from a wide range of scientific publications and cover topics such as combinatorics on words, pattern matching, efficient text data structures, regularities in words, and text compression. \u003c\/blockquote\u003e\u003cp\u003e                                                            \u003cstrong\u003eFormat\u003c\/strong\u003e: Hardback\u003cbr\u003e                              \u003cstrong\u003eLength\u003c\/strong\u003e: 320 pages\u003cbr\u003e                              \u003cstrong\u003ePublication date\u003c\/strong\u003e: 01 July 2021\u003cbr\u003e                              \u003cstrong\u003ePublisher\u003c\/strong\u003e: Cambridge University Press\u003cbr\u003e                          \u003c\/p\u003e \u003cp\u003e\u003cbr\u003eString matching is a fundamental algorithmic technique that has been widely used in computer science for decades. Over the past two decades, significant advancements have been made in various applications, ranging from information retrieval to compression. This comprehensive collection of puzzles and exercises in key areas of text algorithms and combinatorics provides a delightful and direct approach for graduate students and researchers to learn and practice advanced concepts. The problems are drawn from a diverse range of scientific publications, including both classic and contemporary works. The book begins by covering the basics and gradually progresses to showcase challenging problems in combinatorics on words, such as Fibonacci or Thue-Morse words. It also explores pattern matching algorithms, including Knuth-Morris-Pratt and Boyer-Moore-like techniques, as well as efficient text data structures like suffix trees and suffix arrays. Additionally, the book delves into regularities in words, such as periods and runs, and text compression methods, including Huffman, Lempel-Ziv, and Burrows-Wheeler-based approaches. By presenting these problems in a step-by-step manner, the book aims to facilitate a deeper understanding of text algorithms and combinatorics, enabling readers to apply these concepts in their research and development endeavors. Whether you are a computer science student or a professional seeking to expand your knowledge in this field, this book is an invaluable resource for your studies and practice.\u003c\/p\u003e\u003cp\u003e                            \u003cstrong\u003eWeight\u003c\/strong\u003e: 618g                            \u003cbr\u003e\u003cstrong\u003eDimension\u003c\/strong\u003e: 158 x 235 x 26 (mm)                            \u003cbr\u003e\u003cstrong\u003eISBN-13\u003c\/strong\u003e: 9781108835831                                                      \u003c\/p\u003e","brand":"Maxime Crochemore,Thierry Lecroq,Wojciech Rytter","offers":[{"title":"Hardback","offer_id":44094849220858,"sku":"9781108835831","price":78.06,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0522\/4297\/2845\/products\/f8703aa8219874149dc96ea20ef2a6dd.jpg?v=1632539352","url":"https:\/\/shulphink.com\/products\/125-problems-in-text-algorithms-with-solutions-1","provider":"Shulph Ink","version":"1.0","type":"link"}