{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:29Z","timestamp":1725856949981},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_5","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T15:33:54Z","timestamp":1464708834000},"page":"63-74","source":"Crossref","is-referenced-by-count":3,"title":["Lempel-Ziv Decoding in External Memory"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Belazzougui","sequence":"first","affiliation":[]},{"given":"Juha","family":"K\u00e4rkk\u00e4inen","sequence":"additional","affiliation":[]},{"given":"Dominik","family":"Kempa","sequence":"additional","affiliation":[]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"issue":"9","key":"5_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988). doi: 10.1145\/48529.48535","journal-title":"Commun. ACM"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-34109-0_8","volume-title":"String Processing and Information Retrieval","author":"G Badkobeh","year":"2012","unstructured":"Badkobeh, G., Crochemore, M., Toopsuwan, C.: Computing the maximal-exponent repeats of an overlap-free string in linear time. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 61\u201372. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34109-0_8"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0054359","volume-title":"Algorithm Theory - SWAT 1998","author":"GS Brodal","year":"1998","unstructured":"Brodal, G.S., Katajainen, J.: Worst-case efficient external-memory priority queues. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol. 1432, pp. 107\u2013118. Springer, Heidelberg (1998). doi: 10.1007\/BFb0054359"},{"issue":"6","key":"5_CR4","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/spe.844","volume":"38","author":"R Dementiev","year":"2008","unstructured":"Dementiev, R., Kettner, L., Sanders, P.: STXXL: standard template library for XXL data sets. Softw. Pract. Exper. 38(6), 589\u2013637 (2008). doi: 10.1002\/spe.844","journal-title":"Softw. Pract. Exper."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ferrada, H., Gagie, T., Hirvola, T., Puglisi, S.J.: Hybrid indexes for repetitive datasets. Phil. Trans. R. Soc. A 372 (2014). doi: 10.1098\/rsta.2013.0137","DOI":"10.1098\/rsta.2013.0137"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: On compressing the textual web. In: Proceedings of 3rd International Conference on Web Search and Web Data Mining (WSDM), pp. 391\u2013400. ACM (2010). doi: 10.1145\/1718487.1718536","DOI":"10.1145\/1718487.1718536"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-642-28332-1_21","volume-title":"Language and Automata Theory and Applications","author":"T Gagie","year":"2012","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 240\u2013251. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-13089-2_23"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/978-3-642-25591-5_67","volume-title":"Algorithms and Computation","author":"T Gagie","year":"2011","unstructured":"Gagie, T., Gawrychowski, P., Puglisi, S.J.: Faster approximate pattern matching in compressed repetitive texts. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 653\u2013662. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25591-5_67"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-642-28332-1_21","volume-title":"Language and Automata Theory and Applications","author":"T Gagie","year":"2012","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 240\u2013251. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-28332-1_21"},{"issue":"3","key":"5_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.14778\/2078331.2078341","volume":"5","author":"C Hoobin","year":"2011","unstructured":"Hoobin, C., Puglisi, S.J., Zobel, J.: Relative Lempel-Ziv factorization for efficient storage and retrieval of web collections. Proc. VLDB 5(3), 265\u2013273 (2011)","journal-title":"Proc. VLDB"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Lempel-Ziv parsing in external memory. In: Proceedings of 2014 Data Compression Conference (DCC), pp. 153\u2013162. IEEE (2014). doi: 10.1109\/DCC.2014.78","DOI":"10.1109\/DCC.2014.78"},{"issue":"13","key":"5_CR12","doi-asserted-by":"crossref","first-page":"3672","DOI":"10.1093\/nar\/gkg617","volume":"31","author":"R Kolpakov","year":"2003","unstructured":"Kolpakov, R., Bana, G., Kucherov, G.: MREPS: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Res. 31(13), 3672\u20133678 (2003). doi: 10.1093\/nar\/gkg617","journal-title":"Nucleic Acids Res."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 596\u2013604. IEEE Computer Society (1999). doi: 10.1109\/SFFCS.1999.814634","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding approximate repetitions under haamming distance. Theor. Comput. Sci. 303(1), 135\u2013156 (2003). doi: 10.1016\/S0304-3975(02)00448-6","DOI":"10.1016\/S0304-3975(02)00448-6"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kreft, S., Navarro, G.: LZ77-like compression with fast random access. In: Proceedings of 2010 Data Compression Conference (DCC), pp. 239\u2013248 (2010). doi: 10.1109\/DCC.2010.29","DOI":"10.1109\/DCC.2010.29"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-21458-5_6","volume-title":"Combinatorial Pattern Matching","author":"S Kreft","year":"2011","unstructured":"Kreft, S., Navarro, G.: Self-indexing based on LZ77. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 41\u201354. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21458-5_6"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-642-16321-0_20","volume-title":"String Processing and Information Retrieval","author":"S Kuruppu","year":"2010","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 201\u2013206. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16321-0_20"},{"issue":"1","key":"5_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Trans. Inf. Theor. 22(1), 75\u201381 (1976). doi: 10.1109\/TIT.1976.1055501","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"4","key":"5_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1561\/0400000014","volume":"2","author":"JS Vitter","year":"2006","unstructured":"Vitter, J.S.: Algorithms and data structures for external memory. Found. Trends Theoret. Comput. Sci. 2(4), 305\u2013474 (2006). doi: 10.1561\/0400000014","journal-title":"Found. Trends Theoret. Comput. Sci."},{"issue":"3","key":"5_CR20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. 23(3), 337\u2013343 (1977). doi: 10.1109\/TIT.1977.1055714","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T02:30:21Z","timestamp":1567996221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}