메뉴 건너뛰기




Volumn 24, Issue 4, 1994, Pages 337-362

Approximate string matching using withinword parallelism

Author keywords

Approximate string matching; Approximate string searching; Edit distance; Parallel algorithm; Parallel computation; Pseudo parallelism

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CHARACTER SETS; CODES (SYMBOLS); DATA PROCESSING; FILE EDITORS; ONLINE SEARCHING; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; PROGRAMMING THEORY;

EID: 0028419898     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.4380240402     Document Type: Article
Times cited : (23)

References (13)
  • 6
    • 49149141669 scopus 로고
    • The theory and computation of evolutionary distances; pattern recognition
    • (1980) J. Algorithms , vol.1 , pp. 359-373
    • Sellers, P.H.1
  • 12
    • 0022219496 scopus 로고
    • ‘A systolic array for rapid string comparison’, Proc. 1985 Chapel Hill Conference on VLSI
    • (1985) , pp. 363-376
    • Lipton, R.J.1    Lopresti, D.2


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