-
1
-
-
0346109265
-
Dictionary matching with one error
-
A. Amir, D. Keselman, G.M. Landau, N. Lewenstein, M. Lewenstein, and M. Rodeh Dictionary matching with one error J. Algorithms 37 2 2000 309 325
-
(2000)
J. Algorithms
, vol.37
, Issue.2
, pp. 309-325
-
-
Amir, A.1
Keselman, D.2
Landau, G.M.3
Lewenstein, N.4
Lewenstein, M.5
Rodeh, M.6
-
2
-
-
84927134023
-
Range searching over tree cross products
-
A.L. Buchsbaum, M.T. Goodrich, J.R. Westbrook, Range searching over tree cross products, in: Proc. 8th European Symposium on Algorithms (ESA), 2000, pp. 120-131.
-
(2000)
Proc. 8th European Symposium on Algorithms (ESA)
, pp. 120-131
-
-
Buchsbaum, A.L.1
Goodrich, M.T.2
Westbrook, J.R.3
-
3
-
-
33746032583
-
A linear size index for approximate pattern matching
-
Springer
-
H. Chan, T.W. Lam, W. Sung, S. Tam, and S. Wong A linear size index for approximate pattern matching Proc. 17th Symposium on Combinatorial Pattern Matching (CPM) LNCS vol. 4009 2006 Springer 49 59
-
(2006)
Proc. 17th Symposium on Combinatorial Pattern Matching (CPM)
, vol.4009
, pp. 49-59
-
-
Chan, H.1
Lam, T.W.2
Sung, W.3
Tam, S.4
Wong, S.5
-
4
-
-
4544388794
-
Dictionary matching and indexing with errors and don't cares
-
R. Cole, L. Gottlieb, M. Lewenstein, Dictionary matching and indexing with errors and don't cares, in: Proc. 36th ACM Symposium on Theory of Computing (STOC), 2004, pp. 91-100.
-
(2004)
Proc. 36th ACM Symposium on Theory of Computing (STOC)
, pp. 91-100
-
-
Cole, R.1
Gottlieb, L.2
Lewenstein, M.3
-
5
-
-
34548665025
-
Languages with mismatches
-
C. Epifanio, A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino Languages with mismatches Theoret. Comput. Sci. 385 1-3 2007 152 166
-
(2007)
Theoret. Comput. Sci.
, vol.385
, Issue.13
, pp. 152-166
-
-
Epifanio, C.1
Gabriele, A.2
Mignosi, F.3
Restivo, A.4
Sciortino, M.5
-
6
-
-
26444594769
-
Indexing structures for approximate string matching
-
A. Gabriele, F. Mignosi, A. Restivo, M. Sciortino, Indexing structures for approximate string matching, in: Proc. 5th Italian Conference on Algorithms and Complexity (CIAC), 2003, pp. 140-151.
-
(2003)
Proc. 5th Italian Conference on Algorithms and Complexity (CIAC)
, pp. 140-151
-
-
Gabriele, A.1
Mignosi, F.2
Restivo, A.3
Sciortino, M.4
-
7
-
-
35048848454
-
Approximate string matching using compressed suffix arrays
-
T.N.D. Huynh, W.K. Hon, T.W. Lam, W.K. Sung, Approximate string matching using compressed suffix arrays, in: Proc. 15th Symposium on Combinatorial Pattern Matching (CPM), 2004, pp. 434-444.
-
(2004)
Proc. 15th Symposium on Combinatorial Pattern Matching (CPM)
, pp. 434-444
-
-
Huynh, T.N.D.1
Hon, W.K.2
Lam, T.W.3
Sung, W.K.4
-
8
-
-
33744960824
-
Improved approximate string matching using compressed suffix data structures
-
T.W. Lam, W.K. Sung, S.S. Wong, Improved approximate string matching using compressed suffix data structures, in: Proc. 16th International Symposium on Algorithms and Computation (ISAAC), 2005, pp. 339-348.
-
(2005)
Proc. 16th International Symposium on Algorithms and Computation (ISAAC)
, pp. 339-348
-
-
Lam, T.W.1
Sung, W.K.2
Wong, S.S.3
-
10
-
-
2442603117
-
A hybrid indexing method for approximate string matching
-
G. Navarro, and R. Baeza-Yates A hybrid indexing method for approximate string matching J. Discrete Algorithms 1 1 2000 205 239
-
(2000)
J. Discrete Algorithms
, vol.1
, Issue.1
, pp. 205-239
-
-
Navarro, G.1
Baeza-Yates, R.2
-
11
-
-
32644438405
-
A metric index for approximate string matching
-
G. Navarro, and E. Chávez A metric index for approximate string matching Theoret. Comput. Sci. 352 1-3 2006 266 279
-
(2006)
Theoret. Comput. Sci.
, vol.352
, Issue.13
, pp. 266-279
-
-
Navarro, G.1
Chávez, E.2
|