55 search results - page 2 / 11 » Fast index for approximate string matching |
CPM
1999
Springer
13 years 10 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...
CPM
2007
Springer
14 years 7 days ago
2007
Springer
SPIRE
2004
Springer
13 years 11 months ago
2004
Springer
ALGORITHMICA
2010
13 years 6 months ago
2010
CPM
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...