TEST - Catálogo BURRF
   

String Processing and Information Retrieval : 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings / edited by Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 7024Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: xiv, 428 páginas 81 ilustraciones recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783642245831
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA75.5-76.95
Recursos en línea: Resumen: This book constitutes the proceedings of the 18th International Symposium on String Processing and Information Retrieval, SPIRE 2011, held in Pisa, Italy, in October 2011. The 30 long and 10 short papers together with 1 keynote presented were carefully reviewed and selected from 102 submissions. The papers are structured in topical sections on introduction to web retrieval, sequence learning, computational geography, space-efficient data structures, algorithmic analysis of biological data, compression, text and algorithms.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

This book constitutes the proceedings of the 18th International Symposium on String Processing and Information Retrieval, SPIRE 2011, held in Pisa, Italy, in October 2011. The 30 long and 10 short papers together with 1 keynote presented were carefully reviewed and selected from 102 submissions. The papers are structured in topical sections on introduction to web retrieval, sequence learning, computational geography, space-efficient data structures, algorithmic analysis of biological data, compression, text and algorithms.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha