Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

Given a sequence S= s 1 s 2… sn of integers smaller than r= O (polylog (n)), we show how S
can be represented using nH 0 (S)+ o (n) bits, so that we can know any sq, as well as …

A succinct full-text self-index is a data structure built on a text T= t 1 t 2... tn, which takes little
space (ideally close to that of the compressed text), permits efficient search for the …

We present a new variable-length encoding scheme for sequences of integers, Directly
Addressable Codes (DACs), which enables direct access to any element of the encoded …

Recently, recognizing affects from both face and body gestures attracts more attentions.
However, it still lacks of efficient and effective features to describe the dynamics of face and …

The combination of incessant advances in sequencing technology producing large amounts
of data and innovative bioinformatics approaches, designed to cope with this data flood, has …

String matching is a ubiquitous problem that arises in a wide range of applications in
computing, eg, packet routing, intrusion detection, web querying, and genome analysis. Due …

Most of the countries use bi-script documents. This is because every country uses its own
national language and English as second/foreign language. Therefore, bi-lingual document …

Given a sequence S of n symbols over some alphabet Σ, we develop a new compression
method that is (i) very simple to implement;(ii) provides O (1) time random access to any …

A compressed full-text self-index for a text T, of size u, is a data structure used to search for
patterns P, of size m, in T, that requires reduced space, ie space that depends on the …