메뉴 건너뛰기




Volumn 72, Issue 1-2, 1999, Pages 65-70

Very fast and simple approximate string matching

Author keywords

Approximate matching; Information retrieval; Text searching

Indexed keywords


EID: 0001803781     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00121-0     Document Type: Article
Times cited : (36)

References (12)
  • 1
    • 84976680267 scopus 로고
    • A new approach to text searching
    • R. Baeza-Yates, G. Gonnet, A new approach to text searching, Comm. ACM 35 (10) (1992) 74-82.
    • (1992) Comm. ACM , vol.35 , Issue.10 , pp. 74-82
    • Baeza-Yates, R.1    Gonnet, G.2
  • 2
    • 0001114905 scopus 로고    scopus 로고
    • Faster approximate string matching
    • Preliminary version in: Proc. CPM'96
    • R. Baeza-Yates, G. Navarro, Faster approximate string matching, Algorithmica 23 (2) (1999) 127-158. Preliminary version in: Proc. CPM'96.
    • (1999) Algorithmica , vol.23 , Issue.2 , pp. 127-158
    • Baeza-Yates, R.1    Navarro, G.2
  • 3
    • 0042960934 scopus 로고    scopus 로고
    • Fast and practical approximate pattern matching
    • R. Baeza-Yates, C. Perleberg, Fast and practical approximate pattern matching, Inform. Process. Lett. 59 (1996) 21-27.
    • (1996) Inform. Process. Lett. , vol.59 , pp. 21-27
    • Baeza-Yates, R.1    Perleberg, C.2
  • 4
    • 84877345747 scopus 로고    scopus 로고
    • A fast bit-vector algorithm for approximate pattern matching based on dynamic programming
    • Springer, Berlin
    • G. Myers, A fast bit-vector algorithm for approximate pattern matching based on dynamic programming, in: Proc. CPM'98, Lecture Notes in Computer Sci., Vol. 1448, Springer, Berlin, 1998, pp. 1-13.
    • (1998) Proc. CPM'98, Lecture Notes in Computer Sci. , vol.1448 , pp. 1-13
    • Myers, G.1
  • 5
    • 0010226893 scopus 로고    scopus 로고
    • Ph.D. Thesis, Department of Computer Science, University of Chile, December Tech. Report TR/DCC-98-14
    • G. Navarro, Approximate text searching, Ph.D. Thesis, Department of Computer Science, University of Chile, December 1998. Tech. Report TR/DCC-98-14.
    • (1998) Approximate Text Searching
    • Navarro, G.1
  • 6
    • 0347647183 scopus 로고    scopus 로고
    • Technical Report TR/DCC-99-5, Department of Computer Science, University of Chile, Submitted
    • G. Navarro, A guided tour to approximate string matching, Technical Report TR/DCC-99-5, Department of Computer Science, University of Chile, 1999. Submitted, ftp:// ftp.dcc.uchile.cl/pub/users/gnavarro/survasm.ps.gz.
    • (1999) A Guided Tour to Approximate String Matching
    • Navarro, G.1
  • 8
    • 84877353682 scopus 로고    scopus 로고
    • A bit-parallel approach to suffix automata: Fast extended string matching
    • Springer, Berlin
    • G. Navarro, M. Raffinot, A bit-parallel approach to suffix automata: Fast extended string matching, in: Proc. CPM'98, Lecture Notes in Computer Sci., Vol. 1448, Springer, Berlin, 1998, pp. 14-33.
    • (1998) Proc. CPM'98, Lecture Notes in Computer Sci. , vol.1448 , pp. 14-33
    • Navarro, G.1    Raffinot, M.2
  • 9
    • 49149141669 scopus 로고
    • The theory and computation of evolutionary distances: Pattern recognition
    • P. Sellers, The theory and computation of evolutionary distances: pattern recognition, J. Algorithms 1 (1980) 359-373.
    • (1980) J. Algorithms , vol.1 , pp. 359-373
    • Sellers, P.1
  • 10
    • 0025467860 scopus 로고
    • A very fast substring search algorithm
    • D. Sunday, A very fast substring search algorithm, Comm. ACM 33 (8) (1990) 132-142.
    • (1990) Comm. ACM , vol.33 , Issue.8 , pp. 132-142
    • Sunday, D.1
  • 11
  • 12
    • 84976654685 scopus 로고
    • Fast text searching allowing errors
    • S. Wu, U. Manber, Fast text searching allowing errors, Comm. ACM 35 (10) (1992) 83-91.
    • (1992) Comm. ACM , vol.35 , Issue.10 , pp. 83-91
    • Wu, S.1    Manber, U.2


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