514 search results - page 9 / 103 » Approximate Periods of Strings |
152
click to vote
DASFAA
2003
IEEE
15 years 8 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
123
Voted
ICDAR
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract
139
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
121
click to vote
CORR
2004
Springer
15 years 3 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)-...
125
Voted
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned versi...