125 Problems in Text Algorithms: with Solutions - Image 1

£66.45

Cambridge University Press 125 Problems in Text Algorithms: with Solutions

Name: 125 Problems in Text Algorithms: with Solutions
Brand: Cambridge University Press
Price: 66.45 GBP
Availability: InStock

Algorithms

This is the usual price. Wait for it to drop, or tell us your number.

£66 today · usual range £60–£81 · best ever £60

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 76 days · 76 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 76 days • 7 price levels

Days at Price

Current Price

Price Analysis

Most common price: £68 (25 days, 32.9%)

Price range: £60 - £81

Price levels: 7 different prices over 76 days

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

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 110883583X
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 01 July 2021
Listed Since: 29 July 2020

Barcode

No barcode data available

Cambridge University Press 125 Problems in Text Algorithms: with Solutions

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

String Algorithms in C: Efficient Text Representation and Search

Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology

Computer Algorithms: String Pattern Matching Strategies: 55 (Practitioners)

Applied Combinatorics on Words: 105 (Encyclopedia of Mathematics and its Applications, Series Number 105)

Flexible Pattern Matching Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences

The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching

Text Algorithms

Springer - Patterns in Permutations and Words Book

Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R (Chapman & Hall/CRC Computational Biology Series)

Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R (Chapman & Hall/CRC Computational Biology Series)

Combinatorics of Compositions and Words (Discrete Mathematics and Its Applications)

Universal Compression and Retrieval: 274 (Mathematics and Its Applications, 274)

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

Algebraic Combinatorics on Words: 90 (Encyclopedia of Mathematics and its Applications, Series Number 90)

Combinatorics on Words 2ed (Cambridge Mathematical Library)

Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)

Emergent Computation: Emphasizing Bioinformatics (Biological and Medical Physics, Biomedical Engineering)

Biological Sequence Analysis Using the SeqAn C++ Library (Chapman & Hall/CRC Computational Biology Series)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

String Analysis for Software Verification and Security

Combinatorial Group Testing and Its Applications (Series on Applied Mathematics): 12

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Sequences, Groups, and Number Theory (Trends in Mathematics)

Exploring Textual Data: 4 (Text, Speech and Language Technology, 4)