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 …

In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix
trees and described the first algorithms for suffix array construction and use. Since that time …

Suffix trees and suffix arrays are widely used and largely interchangeable index structures
on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space …

Zero-day polymorphic worms pose a serious threat to the security of Internet infrastructures.
Given their rapid propagation, it is crucial to detect them at edge networks and automatically …

We present, in this paper, two efficient algorithms for linear time suffix array construction.
These two algorithms achieve their linear time complexities, using the techniques of divide …

The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

We present a linear time and space suffix array (SA) construction algorithm called the SA-IS
algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the problem …

A compressed full-text self-index represents a text in a compressed form and still answers
queries efficiently. This represents a significant advancement over the (full-) text indexing …

Zero-day polymorphic worms pose a serious threat to the Internet security. With their ability
to rapidly propagate, these worms increasingly threaten the Internet hosts and services. Not …

Efficient and expressive comparison of sequences is an essential procedure for learning
with sequential data. In this article we propose a generic framework for computation of …