{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:26:07Z","timestamp":1742984767143,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_64","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"760-771","source":"Crossref","is-referenced-by-count":0,"title":["Distribution-Aware Compressed Full-Text Indexes"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[]},{"given":"Jouni","family":"Sir\u00e9n","sequence":"additional","affiliation":[]},{"given":"Rossano","family":"Venturini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02574380","volume":"12","author":"A. Aggarwal","year":"1994","unstructured":"Aggarwal, A., Schieber, B., Tokuyama, T.: Finding a minimum-weight k-link path graphs with the concae monge property and applications. Discrete & Computational Geometry\u00a012, 263\u2013280 (1994)","journal-title":"Discrete & Computational Geometry"},{"key":"64_CR2","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"key":"64_CR3","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Gonz\u00e1lez, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. ACM Journal of Experimental Algorithmics, 13 (2008)","DOI":"10.1145\/1412228.1455268"},{"issue":"4","key":"64_CR4","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM\u00a052(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: On compressing the textual web. In: WSDM, pp. 391\u2013400 (2010)","DOI":"10.1145\/1718487.1718536"},{"key":"64_CR6","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841\u2013850 (2003)"},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proc. of the 32nd ACM Symposium on Theory of Computing, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44693-1_28","volume-title":"STACS 2001","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 317\u2013326. Springer, Heidelberg (2001)"},{"issue":"4","key":"64_CR9","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/0216043","volume":"16","author":"D.S. Hirschberg","year":"1987","unstructured":"Hirschberg, D.S., Larmore, L.L.: The least weight subsequence problem. SIAM Journal on Computing\u00a016(4), 628\u2013638 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"64_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM\u00a048(3), 407\u2013430 (2001)","journal-title":"Journal of the ACM"},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"issue":"2","key":"64_CR12","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0196-6774(03)00087-7","volume":"48","author":"K. Sadakane","year":"2003","unstructured":"Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. Algorithms\u00a048(2), 294\u2013313 (2003)","journal-title":"J. Algorithms"},{"issue":"2","key":"64_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jagm.1998.0955","volume":"29","author":"B. Schieber","year":"1998","unstructured":"Schieber, B.: Computing a minimum weight k-link path in graphs with the concave monge property. J. Algorithms\u00a029(2), 204\u2013222 (1998)","journal-title":"J. Algorithms"},{"issue":"1-2","key":"64_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1500000013","volume":"4","author":"F. Silvestri","year":"2010","unstructured":"Silvestri, F.: Mining query logs: Turning search usage data into knowledge. Foundations and Trends in Information Retrieval\u00a04(1-2), 1\u2013174 (2010)","journal-title":"Foundations and Trends in Information Retrieval"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:24:18Z","timestamp":1558297458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}