{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T06:10:56Z","timestamp":1782108656085,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327554","type":"print"},{"value":"9783540327561","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_64","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"703-714","source":"Crossref","is-referenced-by-count":34,"title":["Position-Restricted Substring Searching"],"prefix":"10.1007","author":[{"given":"Veli","family":"M\u00e4kinen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G., Rahue, T.: New data structures for orthogonal range searching. In: Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 198\u2013207 (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"key":"64_CR2","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)"},{"issue":"3","key":"64_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing\u00a017(3), 427\u2013462 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"64_CR4","unstructured":"Clark, D.: Compact Pat Trees. PhD thesis, University of Waterloo (1996)"},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"issue":"4","key":"64_CR6","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 texts. Journal of the ACM\u00a052(4), 552\u2013581 (2005)","journal-title":"Journal of the ACM"},{"key":"64_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-30213-1_23","volume-title":"String Processing and Information Retrieval","author":"P. Ferragina","year":"2004","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: An alphabet-friendly FM-index. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 150\u2013160. Springer, Heidelberg (2004)"},{"key":"#cr-split#-64_CR8.1","unstructured":"Ferragina, P., Manzini, G., M??kinen, V., Navarro, G.: Compressed representation of sequences and full-text indexes. Technical Report 2004-05, Technische Fakult??t, Universit??t Bielefeld, Germany (December 2004);"},{"key":"#cr-split#-64_CR8.2","unstructured":"Submitted to a journal"},{"key":"64_CR9","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Succinct representation of sequences. Technical Report TR\/DCC-2004-5, Department of Computer Science, University of Chile, Chile (August 2004), \n                    \n                      ftp:\/\/ftp.dcc.uchile.cl\/pub\/users\/gnavarro\/sequences.ps.gz"},{"key":"64_CR10","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841\u2013850 (2003)"},{"key":"64_CR11","unstructured":"Grossi, R., Gupta, A., Vitter, J.: When indexing equals compression: Experiments with compressing suffix arrays and applications. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 636\u2013645 (2004)"},{"key":"64_CR12","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th IEEE Symp. Foundations of Computer Science (FOCS 1989), pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"#cr-split#-64_CR13.1","unstructured":"K??rkk??inen, J.: Repetition-based text indexes. PhD thesis, Dept. of Computer Science, University of Helsinki, Finland (1999);"},{"key":"#cr-split#-64_CR13.2","unstructured":"Also available as Report A-1999-4, Series A"},{"key":"64_CR14","doi-asserted-by":"crossref","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 935\u2013948 (1993)","DOI":"10.1137\/0222058"},{"issue":"3","key":"64_CR15","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_CR16","series-title":"Lecture Notes in Computer Science","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. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"key":"64_CR17","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. Technical Report TR\/DCC-2005-7, Department of Computer Science, University of Chile, Chile (June 2005), \n                    \n                      ftp:\/\/ftp.dcc.uchile.cl\/pub\/users\/gnavarro\/survcompr.ps.gz\n                    \n                    \n                  , Submitted to a journal"},{"key":"64_CR18","unstructured":"Raman, R., Raman, V., Srinivasa Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2002), pp. 233\u2013242 (2002)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T12:48:55Z","timestamp":1552394935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11682462_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}