메뉴 건너뛰기




Volumn 1741, Issue , 1999, Pages 225-236

Constructing the suffix tree of a tree with a large alphabet

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; PATTERN MATCHING;

EID: 84958051164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_24     Document Type: Conference Paper
Times cited : (19)

References (13)
  • 2
    • 0000061584 scopus 로고    scopus 로고
    • The Suffix Tree of a Tree and Minimizing Sequential Transducers
    • D. Breslauer, "The Suffix Tree of a Tree and Minimizing Sequential Transducers," J. Theoretical Computer Science, Vol. 191, 1998, pp. 131-144.
    • (1998) J. Theoretical Computer Science , vol.191 , pp. 131-144
    • Breslauer, D.1
  • 3
    • 0001884405 scopus 로고
    • A. Apostolico and Z. Galil, eds., Combinatorial Algorithms on Words, Chapter 12, NATO ASI Series F: Computer and System Sciences
    • M. T. Chen and J. Seiferas, "Efficient and Elegant Subword Tree Construction," A. Apostolico and Z. Galil, eds., Combinatorial Algorithms on Words, Chapter 12, NATO ASI Series F: Computer and System Sciences, 1985, pp. 97-107.
    • (1985) "Efficient and Elegant Subword Tree Construction , pp. 97-107
    • Chen, M.T.1    Seiferas, J.2
  • 9
    • 0021426157 scopus 로고
    • Fast Algorithms for Finding Nearest Common Ancestors
    • D. Harel and R. R. Tarjan, "Fast Algorithms for Finding Nearest Common Ancestors," SIAM J. Computing, Vol. 13, 1984, pp. 338-355.
    • (1984) SIAM J. Computing , vol.13 , pp. 338-355
    • Harel, D.1    Tarjan, R.R.2
  • 11
    • 0016942292 scopus 로고    scopus 로고
    • E. M. McCreight, "A Space-Economical Suffix Tree Construction Algorithm," J. ACM, Vol. 23, 1976, pp. 262-272.
    • McCreight, E.M.1
  • 12
    • 0001704377 scopus 로고    scopus 로고
    • E. Ukkonen, "On-Line Construction of Suffix-Trees," Algorithmica, Vol. 14, 1995, pp. 249-60.
    • Ukkonen, E.1


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