• Publications
  • Influence
Incremental String Comparison
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 followingExpand
  • 169
  • 21
  • PDF
Fast Parallel and Serial Approximate String Matching
TLDR
We present parallel and serial algorthms for finding all occurrences of the pattern in the text with at most k differences. Expand
  • 350
  • 20
Efficient String Matching with k Mismatches
TLDR
We present an algorithm for finding all occurrences of the pattern in the text, each with at most k mismatches, in O( k ( m log m + n )) time. Expand
  • 189
  • 14
  • PDF
Random access to grammar-compressed strings
TLDR
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
  • 80
  • 9
  • PDF
Introducing efficient parallelism into approximate string matching and a new serial algorithm
TLDR
We present parallel and serial algorithms for finding all occurrences of the pattern in the text with at most k differences. Expand
  • 138
  • 8
On Cartesian Trees and Range Minimum Queries
TLDR
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
  • 42
  • 8
  • PDF
On the Common Substring Alignment Problem
TLDR
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
  • 47
  • 7
  • PDF
Tree compression with top trees
TLDR
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
  • 27
  • 7
  • PDF
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
TLDR
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
  • 141
  • 6
  • PDF
An Algorithm for Approximate Tandem Repeats
TLDR
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
  • 151
  • 6