125 Problems in Text Algorithms: with Solutions
Crochemore, Maxime; Lecroq, Thierry; Rytter, Wojciech
ISBN 10: 110883583X ISBN 13: 9781108835831
Editorial: Cambridge University Press, 2021
Nuevos
Encuadernación de tapa dura
Librería:
Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 19 de enero de 2007
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
N° de ref. del artículo 378545027
Sinopsis:
Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.
Acerca de los autores:
Maxime Crochemore is Emeritus Professor of Université Gustave-Eiffel and of King's College London. He holds an Honorary Doctorate from the University of Helsinki. He is the author of more than 200 articles on algorithms on strings and their applications, and co-author of several books on the subject.
Thierry Lecroq is Professor in the Department of Computer Science at the University of Rouen Normandy (France). He is currently head of the research team 'Information Processing in Biology and Health' of the 'Laboratory of Computer Science, Information Processing and System'. He has been one of the coordinator of the working group in Stringology of the French CNRS for more than 10 years.
Wojciech Rytter is Professor of University of Warsaw. He is the author of a large number of publications on automata, formal languages, parallel algorithms and algorithms on texts. He is a co-author of several books on these subjects, including 'Efficient Parallel Algorithms', 'Text Algorithms' and 'Analysis of algorithms and data structures'. He is a member of Academia Europaea.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: 125 Problems in Text Algorithms: with ...
Editorial: Cambridge University Press
Año de publicación: 2021
Encuadernación: Encuadernación de tapa dura
Condición: New
Los mejores resultados en AbeBooks
Imagen de archivo
125 Problems in Text Algorithms: with Solutions
Publicado por
Cambridge University Press, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Antiguo o usado
Tapa dura
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
hardcover. Condición: Very Good. Nº de ref. del artículo: mon0003744774
Cantidad disponible: 1 disponibles
Imagen de archivo
125 Problems in Text Algorithms
Publicado por
Cambridge University Press, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FM-9781108835831
Cantidad disponible: 9 disponibles
Imagen de archivo
125 Problems in Text Algorithms: with Solutions
Publicado por
Cambridge University Press, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar2317530288487
Cantidad disponible: 2 disponibles
Imagen de archivo
125 Problems in Text Algorithms
Publicado por
Cambridge University Press, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FM-9781108835831
Cantidad disponible: 9 disponibles
Imagen de archivo
125 Problems in Text Algorithms: with Solutions
Publicado por
Cambridge University Press, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. New copy - Usually dispatched within 4 working days. 610. Nº de ref. del artículo: B9781108835831
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
125 Problems in Text Algorithms (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9781108835831
Cantidad disponible: 1 disponibles
Imagen de archivo
125 Problems in Text Algorithms: with Solutions
Publicado por
Cambridge University Press, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock. Nº de ref. del artículo: __110883583X
Cantidad disponible: 1 disponibles
Imagen del vendedor
125 Problems in Text Algorithms : With Solutions
Publicado por
Cambridge University Press, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 41901880-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
125 Problems in Text Algorithms
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. 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 . Nº de ref. del artículo: 403838879
Cantidad disponible: 5 disponibles
Imagen del vendedor
125 Problems in Text Algorithms (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X
ISBN 13: 9781108835831
Nuevo
Tapa dura
Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781108835831
Cantidad disponible: 1 disponibles