{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:13:36Z","timestamp":1758845616508,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_30","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"284-293","source":"Crossref","is-referenced-by-count":3,"title":["Fast Construction of Generalized Suffix Trees over a Very Large Alphabet"],"prefix":"10.1007","author":[{"given":"Zhixiang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Richard","family":"Fowler","sequence":"additional","affiliation":[]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Chunyue","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"J. Borges and M. Levene. Data mining of user navigation patterns. MS99, 1999.","DOI":"10.1007\/3-540-44934-5_6"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"A.G. Buchner and M.D. Mulvenna. Discovering internet marketing intelligence through online analytical web usage mining. ACM SIGMOD RECORD, pages 54\u201361, Dec. 1998.","DOI":"10.1145\/306101.306124"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"L. Catledge and J. Pitkow. Characterizing browsing behaviors on the world wide web. Computer Networks and ISDN Systems, 27, 1995.","DOI":"10.1016\/0169-7552(95)00043-7"},{"key":"30_CR4","unstructured":"Z. Chen, R. Fowler, and A. Fu, Linear time algorithms for finding maximal forward references, Proc. of the IEEE Intl. Conf. on Info. Tech.: Coding & computing (ITCC 2003), 2003."},{"key":"30_CR5","unstructured":"Z. Chen, R. Fowler, A. Fu, and C. Wang, Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs, Proceeding of the Seventh International Database Engineering and Applications Symposium, 2003."},{"key":"30_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-47887-6_28","volume-title":"Optimal algorithms for finding user access sessions from very large Web logs, Advances in Knowledge Discovery and Data Mining\/PAKDD\u201902","author":"Z. Chen","year":"2002","unstructured":"Z. Chen, A. Fu, and F. Tong, Optimal algorithms for finding user access sessions from very large Web logs, Advances in Knowledge Discovery and Data Mining\/PAKDD\u201902, Lecture Notes in Computer Science 2336, pages 290\u2013296, 2002. (Full version will appear in Journal of World Wide Web: Internet and Information Systems, 2003.)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/69.687980","volume":"10","author":"M.S. Chen","year":"1998","unstructured":"M.S. Chen, J.S. Park, and P.S. Yu. Efficient data mining for path traversal patterns. IEEE Transactions on Knowledge and Data Engineering, 10:2:209\u2013221, 1998.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"30_CR9","unstructured":"E. Hunt, M.P. Atkinson and R.W. Irving, A database index to large biological sequences, Proceedings of the 27th International Conference on Very Large Data Bases, pages 139\u2013148, 2001."},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/360402.360406","volume":"2","author":"R. Kosala","year":"2000","unstructured":"R. Kosala and H. Blockeel, Web mining research: A survey, SIGKDD Explorations, 2(1), pages 1\u201315, 2000.","journal-title":"Web mining research: A survey, SIGKDD Explorations"},{"issue":"5\u20136","key":"30_CR11","first-page":"571","volume":"2","author":"F. Masseglia","year":"1999","unstructured":"F. Masseglia, P. Poncelet, and R. Cicchetti, An efficient algorithm for Web usage mining, Networking and Information Systems Journal, 2(5\u20136), pages 571\u2013603, 1999.","journal-title":"An efficient algorithm for Web usage mining, Networking and Information Systems Journal"},{"key":"30_CR12","unstructured":"J. Pitkow and P. Pirolli, Mining longest repeating subsequences to predict World Wide Web Surfing, Proc. of the Second USENIX Symposium on Internet Technologies & Systems, pages 11\u201314, 1999."},{"issue":"2","key":"30_CR13","first-page":"262","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"E.M. McCreight, A space-economical suffix tree construction algorithm, Journal of Algorithms, 23(2), pages 262\u2013272, 1976.","journal-title":"Journal of Algorithms"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"C. Shababi, A.M. Zarkesh, J. Abidi, and V. Shah. Knowledge discovery from user\u2019s web page navigation. Proceedings of the Seventh IEEE Intl. Workshop on Research Issues in Data Engineering (RIDE), pages 20\u201329, 1997.","DOI":"10.1109\/RIDE.1997.583692"},{"key":"30_CR15","unstructured":"Z. Su, Q. Yang, Y. Lu, and H. Zhang, WhatNext: A prediction system for Web requests using N-gram sequence models, Proc. of the First International Conference on Web Information Systems Engineering, pages 200\u2013207, 2000."},{"issue":"3","key":"30_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"E. Ukkonen, On-line construction of suffix trees, Algorithmica, 14(3), pages 249\u2013260, 1995.","journal-title":"Algorithmica"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms, Proc. of the 14th IEEE Annual Symp. on Switching and Automata Theory, pages 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:25:28Z","timestamp":1737501928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}