{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:31:06Z","timestamp":1773772266686,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642051968","type":"print"},{"value":"9783642051975","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05197-5_19","type":"book-chapter","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T09:20:49Z","timestamp":1257153649000},"page":"267-280","source":"Crossref","is-referenced-by-count":2,"title":["On the Suitability of Suffix Arrays for Lempel-Ziv Data Compression"],"prefix":"10.1007","author":[{"given":"Artur J.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"Arlindo L.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio A. T.","family":"Figueiredo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Fiala, M., Holub, J.: DCA using suffix arrays. In: Data Compression Conference DCC 2008, p. 516 (2008)","DOI":"10.1109\/DCC.2008.95"},{"key":"19_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)"},{"issue":"6","key":"19_CR4","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. Karkainen","year":"2006","unstructured":"Karkainen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM\u00a053(6), 918\u2013936 (2006)","journal-title":"Journal of the ACM"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Larsson, N.: Extended application of suffix trees to data compression. In: Data Compression Conference, p. 190 (1996)","DOI":"10.1109\/DCC.1996.488324"},{"key":"19_CR6","unstructured":"Larsson, N.: Structures of String Matching and Data Compression. PhD thesis, Department of Computer Science, Lund University, Sweden (1999)"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. McCreight","year":"1976","unstructured":"McCreight, E.: A space-economical suffix tree construction algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-40996-3_35","volume-title":"Algorithms and Computation","author":"K. Sadakane","year":"2000","unstructured":"Sadakane, K.: Compressed text databases with efficient query algorithms based on the compressed suffix array. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 410\u2013421. Springer, Heidelberg (2000)"},{"key":"19_CR10","volume-title":"Data Compression - The complete reference","author":"D. Salomon","year":"2007","unstructured":"Salomon, D.: Data Compression - The complete reference, 4th edn. Springer-Verlag London Ltd., London (2007)","edition":"4"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Sestak, R., L\u00e1nsk\u00fd, J., Zemlicka, M.: Suffix array for large alphabet. In: Data Compression Conference DCC 2008, p. 543 (2008)","DOI":"10.1109\/DCC.2008.22"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"J. Storer","year":"1982","unstructured":"Storer, J., Szymanski, T.: Data compression via textual substitution. Journal of ACM\u00a029(4), 928\u2013951 (1982)","journal-title":"Journal of ACM"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: 14th Annual IEEE Symposium on Switching and Automata Theory, vol.\u00a027, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, S., Nong, G.: Fast and space efficient linear suffix array construction. In: Data Compression Conference DCC 2008, p. 553 (2008)","DOI":"10.1109\/DCC.2008.61"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a0IT-23(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Communications in Computer and Information Science","e-Business and Telecommunications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05197-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:49:14Z","timestamp":1606186154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05197-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642051968","9783642051975"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05197-5_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}