139 search results - page 2 / 28 » Finding Gale Strings |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
IMCSIT
2010
13 years 2 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...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
DAM
2007
13 years 4 months ago
2007
DEBU
2010
13 years 4 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...