21 search results - page 1 / 5 » Finding Patterns in Strings using Suffixarrays |
IMCSIT
2010
13 years 5 months ago
2010
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
DIS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
DIS
2000
Springer
14 years 18 hour ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
ALT
1997
Springer
13 years 11 months ago
1997
Springer
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...