92 search results - page 6 / 19 » Maximal repetitions in strings |
PR
2002
13 years 6 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...
ICDE
2012
IEEE
11 years 9 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
FUIN
2010
13 years 5 months ago
2010
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
ISMIS
2005
Springer
14 years 6 days ago
2005
Springer
Abstract. The post-genomic era showed up a wide range of new challenging issues for the areas of knowledge discovery and intelligent information management. Among them, the discove...
FUIN
2008
13 years 6 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 ...