{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:18Z","timestamp":1725544038938},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_28","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"306-317","source":"Crossref","is-referenced-by-count":16,"title":["Dynamic Entropy-Compressed Sequences and Full-Text Indexes"],"prefix":"10.1007","author":[{"given":"Veli","family":"M\u00e4kinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"NATO ISI Series","doi-asserted-by":"crossref","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":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1007\/11602613_113","volume-title":"Algorithms and Computation","author":"D. Arroyuelo","year":"2005","unstructured":"Arroyuelo, D., Navarro, G.: Space-efficient construction of LZ-index. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1143\u20131152. Springer, Heidelberg (2005)"},{"unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)","key":"28_CR3"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-27801-6_34","volume-title":"Combinatorial Pattern Matching","author":"W.-L. Chan","year":"2004","unstructured":"Chan, W.-L., Hon, W.-K., Lam, T.-W.: Compressed index for a dynamic collection of texts. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 445\u2013456. Springer, Heidelberg (2004)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-51542-9_5","volume-title":"Algorithms and Data Structures","author":"P. Dietz","year":"1989","unstructured":"Dietz, P.: Optimal algorithms for list indexing and subset rank. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382, pp. 39\u201346. Springer, Heidelberg (1989)"},{"doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. FOCS 2000, pp. 390\u2013398 (2000)","key":"28_CR6","DOI":"10.1109\/SFCS.2000.892127"},{"doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representation of sequences and full-text indexes. ACM Transactions on Algorithms (to appear, 2006); Preliminary versions, In: Proc. SPIRE 2004 and Tech. Rep. TR\/DCC-2004-5, Dept. of Computer Science Univ. of Chile, ftp:\/\/ftp.dcc.uchile.cl\/pub\/users\/gnavarro\/sequences.ps.gz","key":"28_CR7","DOI":"10.1145\/1240233.1240243"},{"unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. SODA 2003, pp. 841\u2013850 (2003)","key":"28_CR8"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-540-24587-2_52","volume-title":"Algorithms and Computation","author":"W.-K. Hon","year":"2003","unstructured":"Hon, W.-K., Sadakane, K., Sung, W.-K.: Succinct data structures for searchable partial sums. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 505\u2013516. Springer, Heidelberg (2003)"},{"issue":"1","key":"28_CR10","first-page":"40","volume":"12","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing\u00a012(1), 40\u201366 (2005)","journal-title":"Nordic Journal of Computing"},{"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)","key":"28_CR11","DOI":"10.1137\/0222058"},{"issue":"1","key":"28_CR12","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 (JDA)\u00a02(1), 87\u2013114 (2004)","journal-title":"Journal of Discrete Algorithms (JDA)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44634-6_39","volume-title":"Algorithms and Data Structures","author":"R. Raman","year":"2001","unstructured":"Raman, R., Raman, V., Srinivasa Rao, S.: Succinct dynamic data structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 426\u2013437. Springer, Heidelberg (2001)"},{"unstructured":"Raman, R., Raman, V., Srinivasa Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. SODA 2002, pp. 233\u2013242 (2002)","key":"28_CR14"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:17Z","timestamp":1619507777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11780441_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}