메뉴 건너뛰기




Volumn 6129 LNCS, Issue , 2010, Pages 63-75

The property suffix tree with dynamic properties

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROPERTY; PREPROCESS; QUERY PATTERNS; SUFFIX-TREES;

EID: 79956305510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13509-5_7     Document Type: Conference Paper
Times cited : (4)

References (18)
  • 2
    • 0017547820 scopus 로고
    • A fast string searching algorithm
    • Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM 20, 762-772 (1977).
    • (1977) Comm. ACM , vol.20 , pp. 762-772
    • Boyer, R.S.1    Moore, J.S.2
  • 4
    • 84957685983 scopus 로고    scopus 로고
    • Perfect hashing for strings: Forrealization and algorithms
    • Combinatorial Pattern Matching
    • Farach, M., Muthukrishnan, S.: Perfect Hashing for Strings: Formalization and Algorithms. In: Proc. 7th Combinatorial Pattern Matching Conference, pp. 130-140 (1996). (Pubitemid 126073715)
    • (1996) Lecture Notes in Computer Science , Issue.1075 , pp. 130-140
    • Farach, M.1    Muthukrishnan, S.2
  • 7
    • 38349109894 scopus 로고    scopus 로고
    • Faster index for property matching
    • Iliopoulos, C.S., Rahman, M.S.: Faster index for property matching. Inf. Process. Lett. 105(6), 218-223 (2008).
    • (2008) Inf. Process. Lett. , vol.105 , Issue.6 , pp. 218-223
    • Iliopoulos, C.S.1    Rahman, M.S.2
  • 8
    • 69049098006 scopus 로고    scopus 로고
    • Errata for "Faster index for property matching"
    • Juan, M.T., Liu, J.J., Wang, Y.L.: Errata for "Faster index for property matching". Inf. Process. Lett. 109(18), 1027-1029 (2009).
    • (2009) Inf. Process. Lett. , vol.109 , Issue.18 , pp. 1027-1029
    • Juan, M.T.1    Liu, J.J.2    Wang, Y.L.3
  • 11
    • 35248830635 scopus 로고    scopus 로고
    • Simple linear work suffix array construction
    • Baeten, J.C.M. Lenstra, J.K. Parrow, J. Woeginger, G.J. (eds.), LNCS, Springer, Heidelberg
    • Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943-955. Springer, Heidelberg (2003).
    • (2003) ICALP 2003 , vol.2719 , pp. 943-955
    • Kärkkäinen, J.1    Sanders, P.2
  • 14
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • McCreight, E.M.: A space-economical suffix tree construction algorithm. J. of the ACM 23, 262-272 (1976).
    • (1976) J. of the ACM , vol.23 , pp. 262-272
    • McCreight, E.M.1
  • 15
    • 0030419032 scopus 로고    scopus 로고
    • Efficient approximate and dynamic matching of patterns using a labeling paradigm
    • Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proc. 37th FOCS, pp. 320-328 (1996).
    • (1996) Proc. 37th FOCS , pp. 320-328
    • Sahinalp, S.C.1    Vishkin, U.2
  • 16
    • 0001704377 scopus 로고
    • On-line construction of suffix trees
    • Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249-260 (1995).
    • (1995) Algorithmica , vol.14 , pp. 249-260
    • Ukkonen, E.1
  • 17
    • 0002484064 scopus 로고
    • Preserving order in a forest in less than logarithmic time and linear space
    • van Emde Boas, P.: Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. Inf. Process. Letters 6(3), 80-82 (1977).
    • (1977) Inf. Process. Letters , vol.6 , Issue.3 , pp. 80-82
    • Van Emde Boas, P.1


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