125 problems in text algorithms : with solutions / Maxime Crochemore, Thierry Lecroq, Wojciech Rytter

Por: Crochemore, MaximeColaborador(es): Lecroq, Thierry [coautor] | Rytter, Wojciech [coautor]Tipo de material: TextoTextoDetalles de publicación: Cambridge : Cambridge University Press, 2021 Descripción: X, 334 p. ; 23 cmISBN: 9781108798853Otro título: One hundred twenty-five problems in text algorithms : with solutionsTema(s): AlgoritmosResumen: 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).
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Inicie sesión para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca de origen Signatura Estado Fecha de vencimiento Código de barras Reserva de ítems
Monografías 02. BIBLIOTECA CAMPUS PUERTO REAL
510.5/CRO/one (Navegar estantería(Abre debajo)) Disponible   Ubicación en estantería | Bibliomaps® 3744899424
Total de reservas: 0

Índice

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

No hay comentarios en este titulo.

para aportar su opinión.

Con tecnología Koha