메뉴 건너뛰기




Volumn 1, Issue 3-4, 2003, Pages 255-280

Directed acyclic subsequence graph - Overview

Author keywords

Directed acyclic subsequence graph; Searching subsequences; Subsequence automation

Indexed keywords


EID: 33645200326     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00029-7     Document Type: Article
Times cited : (37)

References (6)
  • 1
    • 0025751083 scopus 로고
    • Searching subsequences
    • R.A. Baeza-Yates, Searching subsequences, Theoret. Comput. Sci. 78 (2) (1991) 363-376.
    • (1991) Theoret. Comput. Sci. , vol.78 , Issue.2 , pp. 363-376
    • Baeza-Yates, R.A.1
  • 3
    • 35248816989 scopus 로고
    • Calcul de la distance par les sous-mots, RAIRO inform
    • J.-J. Hébrard, M. Crochemore, Calcul de la distance par les sous-mots, RAIRO Inform. Théor. Appl. 20 (4) (1986) 441-456.
    • (1986) Théor. Appl. , vol.20 , Issue.4 , pp. 441-456
    • Hébrard, J.-J.1    Crochemore, M.2
  • 4
    • 0021293897 scopus 로고
    • Computing a longest common subsequence for a set of strings
    • W.J. Hsu, M.W. Du, Computing a longest common subsequence for a set of strings, BIT 24 (1984) 45-59.
    • (1984) BIT , vol.24 , pp. 45-59
    • Hsu, W.J.1    Du, M.W.2
  • 5
    • 0042565513 scopus 로고
    • The complexity of subsequences, supersequences and related problem
    • V.G. Timkovsky, The complexity of subsequences, supersequences and related problem, Kybern. 5 (1989) 1-13.
    • (1989) Kybern , vol.5 , pp. 1-13
    • Timkovsky, V.G.1
  • 6
    • 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가 분석하여 추출한 것입니다.