메뉴 건너뛰기




Volumn 12, Issue 4-5, 1994, Pages 345-374

A sublinear algorithm for approximate keyword searching

Author keywords

Approximate match; Dynamic programming; Index; word neighborhood

Indexed keywords

APPROXIMATION THEORY; BIOCHEMISTRY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; NUCLEIC ACID SEQUENCES; ONLINE SEARCHING; QUERY LANGUAGES;

EID: 0028516571     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01185432     Document Type: Article
Times cited : (117)

References (13)
  • 3
    • 84936650974 scopus 로고    scopus 로고
    • Chang, W. I., and E. L. Lawler, Approximate matching in sublinear expected time, Proc. 31st IEEE Symp. on Foundation of Computer Science, 1990, pp. 116–124.
  • 6
    • 84936650961 scopus 로고    scopus 로고
    • Landau, G. M., and U. Vishkin, Introducing efficient parallelism into approximate string matching and a new serial algorithm, Proc. Symp. on Theory of Computing, 1986, pp. 220–230.
  • 7
    • 0242405251 scopus 로고
    • Incremental alignment algorithms and their applications
    • Department of Computer Science, University of Arizona, Tucson, AZ 85721
    • (1986) Technical Report 86-22
    • Myers, E.W.1
  • 9
    • 0023045689 scopus 로고
    • Computer program for the IBM personal computer that searches for approximate matches to short oligonucleotide sequences in long target DNA sequences
    • (1986) Nucleic Acids Res. , vol.14 , Issue.1 , pp. 1025-1041
    • Myers, E.W.1    Mount, D.2
  • 10
    • 49149141669 scopus 로고
    • The theory and computation of evolutionary distances: Pattern recognition
    • (1980) J. Algorithms , vol.1 , pp. 359-373
    • Sellers, P.H.1


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