Vive la FIL Quito en Buscalibre con hasta 60% DTO  Ver más

Enviar a
Quito, Pichincha
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Selecciona tu país

América

Europa

Resto del mundo

portada Jewels of Stringology: Text Algorithms (en Inglés)
Formato
Libro Físico
Año
2002
Idioma
Inglés
N° páginas
320
Encuadernación
Tapa Blanda
Dimensiones
22.8x15.5x1.6 cm
Peso
0.45 kg.
ISBN
9810248970
ISBN13
9789810248970

Jewels of Stringology: Text Algorithms (en Inglés)

Wojciech Rytter (Autor) · Maxime Crochemore (Autor) · World Scientific Publishing Company · Tapa Blanda

Jewels of Stringology: Text Algorithms (en Inglés) - Crochemore, Maxime ; Rytter, Wojciech

Libro Nuevo Importado
Envío: 16 a 22 días háb.
$ 139.39$ 69.69
-50%
Costos de importación incluídos en el precio ✅
Libro Nuevo

Quedan 50 unidades

$ 69.69
Llega entre el 22 Oct y el 05 Nov a Quito, Pichincha. Seleccionar ubicación

Reseña del libro "Jewels of Stringology: Text Algorithms (en Inglés)"

The term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.

Opiniones del libro

Preguntas frecuentes sobre el libro

Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.

Preguntas y respuestas sobre el libro

¿Tienes una pregunta sobre el libro? Inicia sesión para poder agregar tu propia pregunta.

Opiniones sobre Buscalibre

Ver más opiniones de clientes