CPM
1993
Springer
13 years 10 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
CPM
1997
Springer
13 years 10 months ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
CPM
1997
Springer
13 years 10 months ago
1997
Springer
CPM
1997
Springer
13 years 10 months ago
1997
Springer
COCOON
1997
Springer
13 years 10 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
COCOON
1997
Springer
13 years 10 months ago
1997
Springer
COCOON
1997
Springer
13 years 10 months ago
1997
Springer
COCOON
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
CPM
1998
Springer
13 years 10 months ago
1998
Springer
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
CPM
1998
Springer
13 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...