125 search results - page 4 / 25 » Cross-Domain Approximate String Matching |
DASFAA
2003
IEEE
14 years 10 days 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...
ICDAR
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract
IWOCA
2009
Springer
14 years 1 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...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
BIRTHDAY
2010
Springer
13 years 2 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...