Given a text of length n, a pattern of length m and an integer k, we present an algorithm for finding all occurrences of the pattern in the text, each with at most k mismatches. The algorithm runs in… (More)

Let <i>S</i> be a string of length <i>N</i> compressed into a context-free grammar <i>S</i> of size <i>n</i>. We present two representations of <i>S</i> achieving <i>O</i>(log <i>N</i>) random access… (More)

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… (More)

We consider the problem of fingerprinting text by sets of symbols. Specifically, if S is a string, of length n, over a finite, ordered alphabet Σ , andS′ is a substring ofS, then thefingerprint of S′… (More)

The Common Substring Alignment Problem is defined as follows: Given a set of one or more strings and a target string . is a common substring of all strings , that is . The goal is to compute the… (More)

Consider the stnng matching problem, where differences between characters of the pattern and characters of the text are allowed. Each difference is due to either a mismatch between a character of the… (More)

The problem of pattern matching urith scalingis defined. The input for the two-dimensional version of the problem consists of an n x n “text” matrix and an m x m “pattern” matrix. We want to find all… (More)

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and… (More)