메뉴 건너뛰기




Volumn 36, Issue 3, 2002, Pages 249-259

Words over an ordered alphabet and suffix permutations

Author keywords

Lyndon words; Suffix permutation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; THEOREM PROVING;

EID: 0036665925     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2002012     Document Type: Article
Times cited : (30)

References (4)
  • 2
    • 0000075456 scopus 로고
    • Factorizing words over an ordered alphabet
    • J.-P. Duval, Factorizing Words over an Ordered Alphabet. J. Algorithms 4 (1983) 363-381.
    • (1983) J. Algorithms , vol.4 , pp. 363-381
    • Duval, J.-P.1
  • 3
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • E.M. McCreight, A Space-Economical Suffix Tree Construction Algorithm. J. Algorithms 23 (1976) 262-272.
    • (1976) J. Algorithms , vol.23 , pp. 262-272
    • McCreight, E.M.1


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