SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2857, Issue , 2003, Pages 95-107

Bit-parallel approximate string matching algorithms with transposition

(1) Hyyrö, Heikki a

a TAMPERE UNIVERSITY OF TECHNOLOGY (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ADJACENT CHARACTERS; APPROXIMATE STRING MATCHING; BIT PARALLELISM; DAMERAU EDIT DISTANCE; ERROR THRESHOLD; EXPERIMENTAL COMPARISON; FILTERING ALGORITHM; LEVENSHTEIN EDIT DISTANCE;

ALGORITHMS;

EID: 0142156691 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-39984-1_8 Document Type: Article

Times cited : (3)

References (16)

1
- 0001114905
- Faster approximate string matching
- R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
- (1999) Algorithmica , vol.23 , Issue.2 , pp. 127-158
- Baeza-Yates, R.¹ Navarro, G.²

2
- 84941869105
- A technique for computer detection and correction of spelling errors
- F. Damerau. A technique for computer detection and correction of spelling errors. Comm. of the ACM, 7(3):171-176, 1964.
- (1964) Comm. of the ACM , vol.7 , Issue.3 , pp. 171-176
- Damerau, F.¹

3
- 0026880778
- A model and a fast algorithm for multiple errors spelling correction
- M. W. Du and S. C. Chang. A model and a fast algorithm for multiple errors spelling correction. Acta Informatica, 29:281-302, 1992.
- (1992) Acta Informatica , vol.29 , pp. 281-302
- Du, M.W.¹ Chang, S.C.²

4
- 0002565067
- Overview of the Third Text REtrieval Conference
- NIST Special Publication 500-207
- D. Herman. Overview of the Third Text REtrieval Conference. In Proc. Third Text REtrieval Conference (TREC-3), pages 1-19, 1995. NIST Special Publication 500-207.
- (1995) Proc. Third Text REtrieval Conference (TREC-3) , pp. 1-19
- Herman, D.¹

5
- 0026979939
- Techniques for automatically correcting words in text
- K. Kukich. Techniques for automatically correcting words in text. ACM Computing Surveys, 24(4):377-439, 1992.
- (1992) ACM Computing Surveys , vol.24 , Issue.4 , pp. 377-439
- Kukich, K.¹

6
- 0001116877
- Binary codes capable of correcting deletions, insertions and reversals
- V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707-710, 1966.
- (1966) Soviet Physics Doklady , vol.10 , Issue.8 , pp. 707-710
- Levenshtein, V.¹

7
- 0000390142
- Original in Russian
- Original in Russian in Doklady Akademii Nauk SSSR, 163(4):845-848, 1965.
- (1965) Doklady Akademii Nauk SSSR , vol.163 , Issue.4 , pp. 845-848

8
- 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.¹

9
- 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.¹

10
- 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 (SPE), 31:1265-1312, 2001.
- (2001) Software Practice and Experience (SPE) , vol.31 , pp. 1265-1312
- Navarro, G.¹

11
- 0141789118
- Improving an algorithm for approximate pattern matching
- G. Navarro and R. Baeza-Yates. Improving an algorithm for approximate pattern matching. Algorithmica, 30(4):473-502, 2001.
- (2001) Algorithmica , vol.30 , Issue.4 , pp. 473-502
- Navarro, G.¹ Baeza-Yates, R.²

12
- 49149141669
- The theory and computation of evolutionary distances: Pattern recognition
- P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1:359-373, 1980.
- (1980) J. of Algorithms , vol.1 , pp. 359-373
- Sellers, P.¹

13
- 0020494998
- Algorithms for approximate string matching
- Esko Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100-118, 1985.
- (1985) Information and Control , vol.64 , pp. 100-118
- Ukkonen, E.¹

14
- 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.¹

15
- 0028419898
- Approximate string matching using within-word parallelism
- April
- A. Wright. Approximate string matching using within-word parallelism. Software Practice and Experience, 24(4):337-362, April 1994.
- (1994) Software Practice and Experience , vol.24 , Issue.4 , pp. 337-362
- Wright, A.¹

16
- 84976654685
- Fast text searching allowing errors
- October
- S. Wu and U. Manber. Fast text searching allowing errors. Comm. of the ACM, 35(10):83-91, October 1992.
- (1992) Comm. of the ACM , vol.35 , Issue.10 , pp. 83-91
- Wu, S.¹ Manber, U.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.