There has been a flurry of recent literature studying streaming algorithms for which the input
stream is chosen adaptively by a black-box adversary who observes the output of the …

In this work, we revisit the fundamental and well-studied problem of approximate pattern
matching under edit distance. Given an integer k, a pattern P of length m, and a text T of …

Given a string S, the compressed indexing problem is to preprocess S into a compressed
representation that supports fast substring queries. The goal is to use little space relative to …

We consider the Tree Augmentation problem: given a graph G=(V, E) with edge-costs and a
tree T on V disjoint to E, find a minimum-cost edge-subset F⊆ E such that T∪ F is 2-edge …

We consider two closely related problems of text indexing in a sub-linear working space.
The first problem is the Sparse Suffix Tree (SST) construction, where a text S is given in read …

We revisit the complexity of one of the most basic problems in pattern matching. In the k-
mismatch problem we must compute the Hamming distance between a pattern of length m …

We consider the streaming complexity of a fundamental task in approximate pattern
matching: the k-mismatch problem. In this problem, we must compute Hamming distances …

This article presents a real-time randomized streaming string-matching algorithm that uses O
(log m) space. The algorithm only makes one-sided small probability false-positive errors …

This paper presents a new approach for automatic concept extraction, using grammatical
parsers and Latent Semantic Analysis. The methodology is described, also the tool used to …

We revisit a fundamental problem in string matching: given a pattern of length m and a text of
length n, both over an alphabet of size σ, compute the Hamming distance (ie, the number of …