{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:19:13Z","timestamp":1725520753169},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540890966"},{"type":"electronic","value":"9783540890973"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89097-3_13","type":"book-chapter","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T06:16:29Z","timestamp":1226297789000},"page":"121-132","source":"Crossref","is-referenced-by-count":10,"title":["Self-indexing Natural Language"],"prefix":"10.1007","author":[{"given":"Nieves R.","family":"Brisaboa","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Fari\u00f1a","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]},{"given":"Angeles S.","family":"Places","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Rodr\u00edguez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"NATO ISI Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, pp. 85\u201396. Springer, Heidelberg (1985)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11780441_29","volume-title":"Combinatorial Pattern Matching","author":"D. Arroyuelo","year":"2006","unstructured":"Arroyuelo, D., Navarro, G., Sadakane, K.: Reducing the space requirement of LZ-index. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 319\u2013330. Springer, Heidelberg (2006)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/(SICI)1097-4571(2000)51:1<69::AID-ASI10>3.0.CO;2-C","volume":"51","author":"R. Baeza-Yates","year":"2000","unstructured":"Baeza-Yates, R., Navarro, G.: Block-addressing indices for approximate text retrieval. J. of the American Society for Information Science\u00a051(1), 69\u201382 (2000)","journal-title":"J. of the American Society for Information Science"},{"key":"13_CR4","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R., Salinger, A.: Experimental analysis of a fast intersection algorithm for sorted sequences. In: Proc. 12th SPIRE, pp. 13\u201324 (2005)","DOI":"10.1007\/11575832_2"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Barbay, J., L\u00f3pez-Ortiz, A., Lu, T.: Faster adaptive set intersections for text searching. In: Proc. 5th WEA, pp. 146\u2013157 (2006)","DOI":"10.1007\/11764298_13"},{"key":"13_CR7","volume-title":"Text compression","author":"T. Bell","year":"1990","unstructured":"Bell, T., Cleary, J., Witten, I.: Text compression. Prentice Hall, Englewood Cliffs (1990)"},{"key":"13_CR8","volume-title":"Proc. 31st ACM SIGIR","author":"N. Brisaboa","year":"2008","unstructured":"Brisaboa, N., Fari\u00f1a, A., Ladra, S., Navarro, G.: Reorganizing compressed text. In: Proc. 31st ACM SIGIR. ACM Press, New York (to appear, 2008)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10791-006-9001-9","volume":"10","author":"N. Brisaboa","year":"2007","unstructured":"Brisaboa, N., Fari\u00f1a, A., Navarro, G., Param\u00e1, J.: Lightweight natural language text compression. Information Retrieval\u00a010, 1\u201333 (2007)","journal-title":"Information Retrieval"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Culpepper, J., Moffat, A.: Compact set representation for information retrieval. In: Proc. 14th SPIRE, pp. 137\u2013148 (2007)","DOI":"10.1007\/978-3-540-75530-2_13"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fari\u00f1a, A., Navarro, G., Param\u00e1, J.: Word-based statistical compressors as natural language compression boosters. In: Proc. 18th DCC, pp. 162\u2013171 (2008)","DOI":"10.1109\/DCC.2008.14"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms (TALG)\u00a03(2) article 20 (2007)","DOI":"10.1145\/1240233.1240243"},{"key":"13_CR13","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th ACM-SIAM SODA, pp. 841\u2013850 (2003)"},{"key":"13_CR14","volume-title":"Information Retrieval - Computational and Theoretical Aspects","author":"H. Heaps","year":"1978","unstructured":"Heaps, H.: Information Retrieval - Computational and Theoretical Aspects. Academic Press, London (1978)"},{"issue":"9","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. Huffman","year":"1952","unstructured":"Huffman, D.: A method for the construction of minimum-redundancy codes. Proc. of the I.R.E.\u00a040(9), 1090\u20131101 (1952)","journal-title":"Proc. of the I.R.E."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"issue":"5","key":"13_CR17","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":"3","key":"13_CR18","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"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/spe.4380190207","volume":"19","author":"A. Moffat","year":"1989","unstructured":"Moffat, A.: Word-based text compression. Software Practice and Experience\u00a019(2), 185\u2013198 (1989)","journal-title":"Software Practice and Experience"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-60220-8_79","volume-title":"Algorithms and Data Structures","author":"A. Moffat","year":"1995","unstructured":"Moffat, A., Katajainen, J.: In-place calculation of minimum-redundancy codes. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995, vol.\u00a0955, pp. 393\u2013402. Springer, Heidelberg (1995)"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. Moura","year":"2000","unstructured":"Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Transactions on Information Systems (TOIS)\u00a018(2), 113\u2013139 (2000)","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"I. Munro","year":"1996","unstructured":"Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S1570-8667(03)00066-2","volume":"2","author":"G. Navarro","year":"2004","unstructured":"Navarro, G.: Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms\u00a02(1), 87\u2013114 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys\u00a039(1) article 2 (2007)","DOI":"10.1145\/1216370.1216372"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1009934302807","volume":"3","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Moura, E., Neubert, M., Ziviani, N., Baeza-Yates, R.: Adding compression to block addressing inverted indexes. Information Retrieval\u00a03(1), 49\u201377 (2000)","journal-title":"Information Retrieval"},{"issue":"2","key":"13_CR26","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. Journal of Algorithms\u00a048(2), 294\u2013313 (2003)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"13_CR27","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms (JDA)\u00a05(1), 12\u201322 (2007)","journal-title":"Journal of Discrete Algorithms (JDA)"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Sanders, P., Transier, F.: Intersection in integer inverted indices. In: Proc. 9th ALENEX (2007)","DOI":"10.1137\/1.9781611972870.7"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Sanders, P., Transier, F.: Compressed inverted indexes for in-memory search engines. In: Proc. 10th ALENEX (2008)","DOI":"10.1137\/1.9781611972887.1"},{"key":"13_CR30","first-page":"175","volume-title":"Proc. 30th ACM SIGIR","author":"T. Strohman","year":"2007","unstructured":"Strohman, T., Croft, B.: Efficient document retrieval in main memory. In: Proc. 30th ACM SIGIR, pp. 175\u2013182. ACM Press, New York (2007)"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"13_CR32","volume-title":"Managing Gigabytes","author":"I. Witten","year":"1999","unstructured":"Witten, I., Moffat, A., Bell, T.: Managing Gigabytes, 2nd edn. Morgan Kaufmann Publishers, San Francisco (1999)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89097-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T02:33:11Z","timestamp":1557887591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89097-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540890966","9783540890973"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89097-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}