The wavelet tree is a flexible data structure that permits representing sequences S [1, n] of
symbols over an alphabet of size σ, within compressed space and supporting a wide range …

Text summarization is the process of reducing text size while preserving its key points.
Thanks to this process, the reading time of the text is also reduced which contributes to …

We describe a data structure that supports access, rank, and select queries, as well as
symbol insertions and deletions, on a string S 1, n over alphabet 1..σ in time …

Sequence representations supporting the queries access, select, and rank are at the core of
many data structures. There is a considerable gap between the various upper bounds and …

The process of searching on the World Wide Web (WWW) is increasing regularly, and users
around the world also use it regularly. In WWW the size of the text corpus is constantly …

Text matching is a process of finding the frequency of occurrences of text pattern in a corpus.
It's very costly to store, process, and retrieve a vast volume of text data. In this paper, we …

Given a file T, we suggest a data structure based on pruning a Huffman shaped Wavelet tree
(WT) according to the underlying skeleton Huffman tree that enables direct access to the i-th …

Positional ranking functions, widely used in Web search engines, improve result quality by
exploiting the positions of the query terms within documents. However, it is well known that …

In this thesis we study the efficient representation of multidimensional grids, presenting new
compact data structures to store and query grids in different application domains. We …

The accessing and processing of textual information (ie the storing and querying of a set of
strings) is especially important for many current applications (eg information retrieval and …