The suffix array SA [1.. n] of a text T of length n is a permutation of {1,…, n} describing the
lexicographical ordering of suffixes of T and is considered to be one of the most important …

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 …

In this paper, we propose a new dynamic compressed index of O (w) space for a dynamic
text T, where w= O (min (z log N log∗ M, N)) is the size of the signature encoding of T, z is …

Typical statistical machine translation systems are trained with static parallel corpora. Here
we account for scenarios with a continuous incoming stream of parallel training data. Such …

We address the problem of finding the locations of all instances of a string P in a text T,
where preprocessing of T is allowed in order to facilitate the queries. Previous data …

We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA).
The algorithm requires O (n log n) time in the worst case, and only O (n) bits of extra space in …

Since their emergence around 2006, Next-Generation Sequencing technologies have been
revolutionizing biological and medical research. Obtaining instantly an extensive amount of …

The Suffix Array SA (S) of a string S [1... n] is an array containing all the suffixes of S sorted
by lexicographic order. The suffix array is one of the most well known indexing data …

Complex Events are sequences of sensor measurements indicating interesting or unusual
activity in the monitored process. Such events are ubiquitous in a wide range of Wireless …

Verifiable pattern matching is the problem of finding a given pattern verifiably from the
outsourced textual data, which is resident in an untrusted remote server. This problem has …