{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:20:45Z","timestamp":1742397645236},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_25","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"267-277","source":"Crossref","is-referenced-by-count":2,"title":["A Suffix Tree Based Prediction Scheme for Pervasive Computing Environments"],"prefix":"10.1007","author":[{"given":"Dimitrios","family":"Katsaros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3-4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1089\/106652700750050844","volume":"7","author":"A. Apostolico","year":"2000","unstructured":"Apostolico, A., Bejerano, G.: Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. Journal of Computational Biology\u00a07(3-4), 381\u2013393 (2000)","journal-title":"Journal of Computational Biology"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1613\/jair.1491","volume":"22","author":"R. Begleiter","year":"2004","unstructured":"Begleiter, R., El-Yaniv, R., Yona, G.: On prediction using variable order Markov models. Journal of Artificial Intelligence Research\u00a022, 385\u2013421 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/bioinformatics\/17.1.23","volume":"17","author":"G. Bejerano","year":"2001","unstructured":"Bejerano, G., Yona, G.: Variations on probabilistic suffix trees: Statistical modeling and prediction of protein families. Bioinformatics\u00a017(1), 23\u201343 (2001)","journal-title":"Bioinformatics"},{"issue":"2-3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1013759724438","volume":"8","author":"A. Bhattacharya","year":"2002","unstructured":"Bhattacharya, A., Das, S.K.: LeZi-Update: An information-theoretic framework for personal mobility tracking in PCS networks. ACM\/Kluwer Wireless Networks\u00a08(2-3), 121\u2013135 (2002)","journal-title":"ACM\/Kluwer Wireless Networks"},{"issue":"3","key":"25_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/MC.2003.1185219","volume":"36","author":"X. Chen","year":"2003","unstructured":"Chen, X., Zhang, X.: A popularity-based prediction model for Web prefetching. IEEE Computer\u00a036(3), 63\u201370 (2003)","journal-title":"IEEE Computer"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J.G. Cleary","year":"1984","unstructured":"Cleary, J.G., Witten, I.H.: Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications\u00a032(4), 396\u2013402 (1984)","journal-title":"IEEE Transactions on Communications"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Curewitz, K.M., Krishnan, P., Vitter, J.S.: Practical prefetching via data compression. In: Proceedings of the ACM International Conference on Data Management (SIGMOD), pp. 257\u2013266 (1993)","DOI":"10.1145\/170035.170077"},{"issue":"6","key":"25_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MWC.2002.1160085","volume":"9","author":"S.K. Das","year":"2002","unstructured":"Das, S.K., Cook, A., Bhattacharya, D.J., Heierman, E.O., Lin, T.-Y.: The role of prediction algorithms in the MavHome smart home architecture. IEEE Wireless Communications\u00a09(6), 77\u201384 (2002)","journal-title":"IEEE Wireless Communications"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/990301.990304","volume":"4","author":"M. Deshpande","year":"2004","unstructured":"Deshpande, M., Karypis, G.: Selective Markov models for predicting Web page accesses. ACM Transactions on Internet Technology\u00a04(2), 163\u2013184 (2004)","journal-title":"ACM Transactions on Internet Technology"},{"issue":"4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.2307\/2324917","volume":"99","author":"A. Ehrenfeucht","year":"1992","unstructured":"Ehrenfeucht, A., Mycielski, J.: A pseudorandom sequence \u2013 How random is it? American Mathematical Monthly\u00a099(4), 373\u2013375 (1992)","journal-title":"American Mathematical Monthly"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/18.272494","volume":"40","author":"M. Feder","year":"1994","unstructured":"Feder, M., Merhav, N.: Relations between entropy and error probability. IEEE Transactions on Information Theory\u00a040(1), 259\u2013266 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/MIC.2004.1297272","volume":"8","author":"D. Katsaros","year":"2004","unstructured":"Katsaros, D., Manolopoulos, Y.: Web caching in broadcast mobile wireless environments. IEEE Internet Computing\u00a08(3), 37\u201345 (2004)","journal-title":"IEEE Internet Computing"},{"key":"25_CR14","unstructured":"Katsaros, D., Manolopoulos, Y.: Prediction in wireless networks by variable length Markov chains (2005) (Manuscript in preparation)"},{"issue":"6","key":"25_CR15","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1137\/S0097539794261817","volume":"27","author":"P. Krishnan","year":"1998","unstructured":"Krishnan, P., Vitter, J.S.: Optimal prediction for prefetching in the worst case. SIAM Journal on Computing\u00a027(6), 1617\u20131636 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"16","key":"25_CR16","doi-asserted-by":"publisher","first-page":"3153","DOI":"10.1016\/j.patrec.2003.08.002","volume":"24","author":"C. Largeron-Let\u00e9no","year":"2003","unstructured":"Largeron-Let\u00e9no, C.: Prediction suffix trees for supervised classification of sequences. Pattern Recognition Letters\u00a024(16), 3153\u20133164 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Misra, A., Roy, A., Das, S.K.: An information-theoretic framework for optimal location tracking in multi-system 4G wireless networks. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), vol.\u00a01, pp. 286\u2013297 (2004)","DOI":"10.1109\/INFCOM.2004.1354502"},{"issue":"5","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1109\/TKDE.2003.1232270","volume":"15","author":"A. Nanopoulos","year":"2003","unstructured":"Nanopoulos, A., Katsaros, D., Manolopoulos, Y.: A data mining algorithm for generalized Web prefetching. IEEE Transactions on Knowledge and Data Engineering\u00a015(5), 1155\u20131169 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"25_CR19","unstructured":"Pitkow, J., Pirolli, P.: Mining longest repeating subsequences to predict World Wide Web surfing. In: Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS), pp. 139\u2013150 (1999)"},{"issue":"2-3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF00114008","volume":"25","author":"D. Ron","year":"1996","unstructured":"Ron, D., Singer, Y., Tishby, N.: The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning\u00a025(2-3), 117\u2013149 (1996)","journal-title":"Machine Learning"},{"issue":"4","key":"25_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/MWC.2004.1325892","volume":"11","author":"A. Roy","year":"2004","unstructured":"Roy, A., Das, S.K., Misra, A.: Exploiting information theory for adaptive mobility and resource management in future wireless cellular networks. IEEE Wireless Communications\u00a011(4), 59\u201365 (2004)","journal-title":"IEEE Wireless Communications"},{"key":"25_CR22","unstructured":"Volf, P.: Weighting techniques in data compression: Theory and algorithms. PhD thesis, Technische Universiteit Eindhoven (2002)"},{"issue":"2","key":"25_CR23","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1109\/18.661523","volume":"44","author":"F.J. Willems","year":"1998","unstructured":"Willems, F.J.: The context-tree weighting method: Extensions. IEEE Transactions on Information Theory\u00a044(2), 792\u2013798 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"25_CR24","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1109\/18.382012","volume":"41","author":"F.J. Willems","year":"1995","unstructured":"Willems, F.J., Shtarkov, Y.M., Tjalkens, T.J.: The context-tree weighting method: Basic properties. IEEE Transactions on Information Theory\u00a041(3), 653\u2013664 (1995)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:52Z","timestamp":1619505652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11573036_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}