메뉴 건너뛰기




Volumn 10, Issue 2, 1989, Pages 157-169

Fast parallel and serial approximate string matching

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0001421462     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(89)90010-2     Document Type: Article
Times cited : (258)

References (25)
  • 4
    • 0001884405 scopus 로고
    • Efficient and elegant subword tree construction
    • A Apostolico, Z Galil, NATO ASI Series F: Computer and System Sciences, Springer-Verlag, New York/Berlin
    • (1985) Combinatorial Algorithms on Words , vol.12 , pp. 97-107
    • Chen1    Seiferas2
  • 19
    • 84915253665 scopus 로고    scopus 로고
    • B. Schieber and U. Vishin, Parallel computation of lowest common ancestor in trees, SIAM J. Comput., in press.
  • 23
    • 84915216427 scopus 로고    scopus 로고
    • U. Vishkin, Optimal parallel pattern matching in strings, in “Proceedings 12th ICALP,” Lecture Notes in Computer Science Vol. 194, pp. 497–508, Springer-Verlag, New York/Berlin


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