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 ...
Read More
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).
Read Less
Add this copy of 125 Problems in Text Algorithms to cart. $49.07, new condition, Sold by Books2anywhere rated 5.0 out of 5 stars, ships from Fairford, GLOUCESTERSHIRE, UNITED KINGDOM, published 2021 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of 125 Problems in Text Algorithms to cart. $100.36, new condition, Sold by Books2anywhere rated 5.0 out of 5 stars, ships from Fairford, GLOUCESTERSHIRE, UNITED KINGDOM, published 2021 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of 125 Problems in Text Algorithms: with Solutions to cart. $49.05, new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2021 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Contains: Unspecified. Includes unspecified. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of 125 Problems in Text Algorithms: with Solutions to cart. $50.46, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2021 by Cambridge University Press.
Add this copy of 125 Problems in Text Algorithms: with Solutions to cart. $55.02, new condition, Sold by Booksplease rated 4.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2021 by Cambridge University Press.
Add this copy of 125 Problems in Text Algorithms: with Solutions to cart. $123.09, new condition, Sold by Booksplease rated 4.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2021 by Cambridge University Press.
