Isbn: 9781108835831 - 125 problems in text algorithms: with solutions (16 resultados)

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Condición: New.

Hardcover. Condición: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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).…

Condición: New. 2021. Hardcover. . . . . . Books ship from the US and Ireland.

Condición: New. 2021. Hardcover. . . . . .

Hardcover. Condición: new. Hardcover. 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). This collection of puzzles and exercises with solutions in key areas of string algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. Copious figures illuminate classic and new problems to tease out deeper understanding of algorithms on strings. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This collection of puzzles and exercises with solutions in key areas of string algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. Copious figures illuminate .…

Condición: New. Print on Demand.

Condición: New. PRINT ON DEMAND.

Buch. Condición: Neu. 125 Problems in Text Algorithms | Maxime Crochemore (u. a.) | Buch | Gebunden | Englisch | 2026 | Cambridge University Press | EAN 9781108835831 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.…