49 search results - page 1 / 10 » A Fast Algorithm for Approximate String Matching on Gene Seq... |
113
Voted
CPM
2005
Springer
15 years 3 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...
127
Voted
CPM
1998
Springer
15 years 2 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
138
click to vote
ICDE
2012
IEEE
13 years 17 days 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 ...
79
Voted
ICDAR
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract
89
Voted
AAAI
2010
14 years 11 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...