The problem of comparing two sequences A and B to determine their longest common subsequence (LCS) or the edit distance between them has been much studied. In this paper we consider the following… Expand

We present two representations of a string of length <i>N</i> compressed into a context-free grammar of size < i>S</i>, and show that these representations can find all approximate occurrences of a pattern in the same time as a single random access query.Expand

We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries and a proof that no Cartesian tree exists for the two-dimensional version of the range minimum query problem.Expand

The Common Substring Alignment Problem is defined as follows: Given a set of one or more strings S1 S2 Sc and a target string T, Y is a common substring of all strings Si, that is, Si=BiYFi.Expand

We introduce a new compression scheme for labeled trees based on top trees that exploits tree pattern repeats and supports navigational queries in logarithmic time.Expand

We address the challenge of computing the similarity of two strings in subquadratic time for metrics which use a scoring matrix of unrestricted weights.Expand

In this paper we address a speci c computational problem that has biological signi cance, namely, the search for repeated patterns within a sequence.Expand