125 Problems in Text Algorithms: with Solutions - Image 1

£40.00

Cambridge University Press 125 Problems in Text Algorithms: with Solutions

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

Languages & Tools

This is the most expensive it has ever been. Walk away.

£40 today · previous high £40 · all-time low £38

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 87 days • 87 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 87 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £38 (75 days, 86.2%)

Price range: £38 - £40

Price levels: 2 different prices over 87 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: paperback
ASIN: 1108798853
Category: Books > Subjects > Computing & Internet > Programming > Languages & Tools
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 most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Algorithms on Strings

Jewels Of Stringology: Text Algorithms

Algorithmic Graph Theory

Automatic Sequences: Theory, Applications, Generalizations

Combinatorial Mathematics

Patterns in Permutations and Words (Monographs in Theoretical Computer Science. An EATCS Series)

Combinatorics, Automata and Number Theory: 135 (Encyclopedia of Mathematics and its Applications, Series Number 135)

Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox

Algorithmic Thinking, 2nd Edition: Learn Algorithms to Level Up Your Coding Skills

Probability, Random Processes, and Statistical Analysis: Applications to Communications, Signal Processing, Queueing Theory and Mathematical Finance

An Introduction to String Diagrams for Computer Scientists (Elements in Applied Category Theory)

Matroids: A Geometric Introduction

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)

Complexity: Knots, Colourings and Countings: 186 (London Mathematical Society Lecture Note Series, Series Number 186)

Open Problems in Mathematics and Computational Science

Guide to Graph Colouring: Algorithms and Applications (Texts in Computer Science)

Finite Geometry and Combinatorial Applications: 82 (London Mathematical Society Student Texts, Series Number 82)

Bandit Algorithms

The Theory of Finite Linear Spaces: Combinatorics of Points and Lines

A Guide to Experimental Algorithmics

Algorithms: Design Techniques And Analysis: Design Techniques and Analysis (Second Edition): 15 (Lecture Notes Series on Computing)

Applying Language Technology in Humanities Research: Design, Application, and the Underlying Logic

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

A First Course in Digital Communications