BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

125 Problems in Text Algorithms: with Solutions

125 Problems in Text Algorithms: with Solutions

125 Problems in Text Algorithms: with Solutions
Stock photo: cover may vary

125 Problems in Text Algorithms: with Solutions Paperback - 2021

by Crochemore, Maxime

Add to wish list
  • New
  • Paperback
New

Description

Cambridge University Press, 2021. Paperback. New. 320 pages. 8.75x6.00x1.00 inches.
Ask the seller a question Add to wish list
A$79.70
A$28.96 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Revaluation Books (Devon, United Kingdom)
The BIBLIO Guarantee

Details

  • Title 125 Problems in Text Algorithms: with Solutions
  • Author Crochemore, Maxime
  • Binding Paperback
  • Condition New
  • Pages 344
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 2021
  • Features Bibliography, Index
  • Bookseller's Inventory # __1108798853
  • ISBN 9781108798853 / 1108798853
  • Weight 1.3 lbs (0.59 kg)
  • Dimensions 8.98 x 6.12 x 0.94 in (22.81 x 15.54 x 2.39 cm)
  • Category Computers - Languages / Programming
  • Library of Congress subjects Computer algorithms, Text processing (Computer science)
  • Library of Congress Catalogue Number 2021002037
  • Dewey Decimal Code 005.13
  • Quantity available 1

About Revaluation Books Devon, United Kingdom

Biblio member since 2020

General bookseller of both fiction and non-fiction.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Revaluation Books

Reader reviews for 125 Problems in Text Algorithms: with Solutions

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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).

Please wait a moment while we load the requested page.

tracking-