139 search results - page 1 / 28 » Finding Gale Strings |
ENDM
2010
13 years 11 months ago
2010
Electronic Notes in Discrete Mathematics 36 (2010) 1065
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
STRINGOLOGY
2008
14 years 8 days ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
ALT
2004
Springer
14 years 7 months ago
2004
Springer
Finding a good pattern which discriminates one set of strings from the other set is a critical task in knowledge discovery. In this paper, we review a series of our works concernin...
PR
2002
13 years 10 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...