57 search results - page 2 / 12 » On-Line Approximate String Matching with Bounded Errors |
DASFAA
2003
IEEE
13 years 10 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...
SIP
2007
13 years 7 months ago
2007
More and more research have been developed very recently for automatic hand recognition. This paper proposes a new method for contactless hand authentication in complex images. Ou...
CPM
1999
Springer
13 years 9 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
FUIN
2006
13 years 5 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
IJFCS
2002
13 years 5 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...