Indexing compressed text.

We design two compressed data structures for the full-text indexing problem that support efficient substring searches using roughly the space required for storing the text in compressed form.Our first compressed data structure retrieves the occ occurrences of a pattern P[1,p] within a text T[1,n] in...

ver descrição completa

Detalhes bibliográficos
Publicado no:	Journal of the ACM 52, 4 (2005).
Autor principal:	Ferragina, Paolo
Formato:	Artigo
Idioma:	English
Assuntos:	Software. Operating systems. Storage management. Data. Data structures. Coding and information theory. Data compaction and compression. Files. Sorting/searching. Theory of computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Pattern matching. Information systems. Information storage and retrieval. Content analysis and indexing. Information storage. Information search and retrieval. Algorithms. Design. Theory.