-
1
-
-
37149024331
-
A bit-vector algorithm for computing Levenshtein and Damerau edit distances
-
H. Hyyrö. A bit-vector algorithm for computing Levenshtein and Damerau edit distances. Nordic Journal of Computing, 10:1-11, 2003.
-
(2003)
Nordic Journal of Computing
, vol.10
, pp. 1-11
-
-
Hyyrö, H.1
-
2
-
-
0027681165
-
Suffix arrays: A new method for on-line string searches
-
U. Manber and E. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, pages 935-948, 1993.
-
(1993)
SIAM Journal on Computing
, pp. 935-948
-
-
Manber, U.1
Myers, E.2
-
3
-
-
0028516571
-
A sublinear algorithm for approximate keyword searching
-
Oct/Nov
-
E. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374, Oct/Nov 1994.
-
(1994)
Algorithmica
, vol.12
, Issue.4-5
, pp. 345-374
-
-
Myers, E.1
-
4
-
-
0000541351
-
A fast bit-vector algorithm for approximate string matching based on dynamic progamming
-
G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM, 46(3):395-415, 1999.
-
(1999)
Journal of the ACM
, vol.46
, Issue.3
, pp. 395-415
-
-
Myers, G.1
-
5
-
-
0345566149
-
A guided tour to approximate string matching
-
G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
-
(2001)
ACM Computing Surveys
, vol.33
, Issue.1
, pp. 31-88
-
-
Navarro, G.1
-
6
-
-
0035841458
-
NR-grep: A fast and flexible pattern matching tool
-
G. Navarro. NR-grep: a fast and flexible pattern matching tool. Software Practice and Experience, 31:1265-1312, 2001.
-
(2001)
Software Practice and Experience
, vol.31
, pp. 1265-1312
-
-
Navarro, G.1
-
7
-
-
2442603117
-
A hybrid indexing method for approximate string matching
-
G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms (JDA), 1(1):205-239, 2000.
-
(2000)
Journal of Discrete Algorithms (JDA)
, vol.1
, Issue.1
, pp. 205-239
-
-
Navarro, G.1
Baeza-Yates, R.2
-
8
-
-
0001851762
-
Indexing methods for approximate string matching
-
G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4):19-27, 2001.
-
(2001)
IEEE Data Engineering Bulletin
, vol.24
, Issue.4
, pp. 19-27
-
-
Navarro, G.1
Baeza-Yates, R.2
Sutinen, E.3
Tarhio, J.4
-
9
-
-
84855618263
-
-
National center for biotechnology information
-
National center for biotechnology information. http://www.ncbi.nlm.nih.gov/.
-
-
-
-
10
-
-
84855637587
-
-
Ucsc human genome project working draft
-
Ucsc human genome project working draft. http://genome.cse.ucsc.edu/.
-
-
-
-
11
-
-
0000386785
-
Finding approximate patterns in strings
-
Esko Ukkonen. Finding approximate patterns in strings. J. of Algorithms, 6:132-137, 1985.
-
(1985)
J. of Algorithms
, vol.6
, pp. 132-137
-
-
Ukkonen, E.1
|