6 search results - page 1 / 2 » Finding Maximal Quasiperiodicities in Strings |
CPM
2000
Springer
13 years 9 months ago
2000
Springer
PR
2002
13 years 4 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...
STRINGOLOGY
2008
13 years 6 months 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...
FUIN
2008
13 years 5 months ago
2008
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
BIRD
2008
Springer
13 years 7 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...