{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T11:02:56Z","timestamp":1746010976891},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_9","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"94-105","source":"Crossref","is-referenced-by-count":19,"title":["Practical Compressed Suffix Trees"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"C\u00e1novas","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"9_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. J. Discr. Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"J. Discr. Algorithms"},{"key":"9_CR2","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":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-642-03784-9_12","volume-title":"SPIRE 2009","author":"N. Brisaboa","year":"2009","unstructured":"Brisaboa, N., Ladra, S., Navarro, G.: Directly addressable variable-length codes. In: Hyyro, H. (ed.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 122\u2013130. Springer, Heidelberg (2009)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-89097-3_18","volume-title":"String Processing and Information Retrieval","author":"F. Claude","year":"2008","unstructured":"Claude, F., Navarro, G.: Practical rank\/Select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 176\u2013187. Springer, Heidelberg (2008)"},{"key":"9_CR5","first-page":"12","volume":"13","author":"P. Ferragina","year":"2009","unstructured":"Ferragina, P., Gonz\u00e1lez, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. ACM J. Exp. Algor.\u00a013, article 12 (2009)","journal-title":"ACM J. Exp. Algor."},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG\u00a03(2), article 20 (2007)","journal-title":"ACM TALG"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-74450-4_41","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"J. Fischer","year":"2007","unstructured":"Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 459\u2013470. Springer, Heidelberg (2007)"},{"issue":"51","key":"9_CR8","doi-asserted-by":"publisher","first-page":"5354","DOI":"10.1016\/j.tcs.2009.09.012","volume":"410","author":"J. Fischer","year":"2009","unstructured":"Fischer, J., M\u00e4kinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comp. Sci.\u00a0410(51), 5354\u20135364 (2009)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.tcs.2006.09.014","volume":"368","author":"R. Geary","year":"2006","unstructured":"Geary, R., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theor. Comp. Sci.\u00a0368, 231\u2013246 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR10","unstructured":"Gonz\u00e1lez, R., Grabowski, S., M\u00e4kinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Proc. 4th WEA (posters), pp. 27\u201338 (2005)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-73437-6_23","volume-title":"Combinatorial Pattern Matching","author":"R. Gonz\u00e1lez","year":"2007","unstructured":"Gonz\u00e1lez, R., Navarro, G.: Compressed text indexes with fast locate. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 216\u2013227. Springer, Heidelberg (2007)"},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02441-2_17","volume-title":"Combinatorial Pattern Matching","author":"J. K\u00e4rkk\u00e4inen","year":"2009","unstructured":"K\u00e4rkk\u00e4inen, J., Manzini, G., Puglisi, S.J.: Permuted longest-common-prefix array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 181\u2013192. Springer, Heidelberg (2009)"},{"issue":"13","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the space requirements of suffix trees. Soft. Pract. Exp.\u00a029(13), 1149\u20131171 (1999)","journal-title":"Soft. Pract. Exp."},{"issue":"11","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"J. Larsson","year":"2000","unstructured":"Larsson, J., Moffat, A.: Off-line dictionary-based compression. Proc. of the IEEE\u00a088(11), 1722\u20131732 (2000)","journal-title":"Proc. of the IEEE"},{"issue":"1","key":"9_CR16","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 J. Comp.\u00a012(1), 40\u201366 (2005)","journal-title":"Nordic J. Comp."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Manber, U., Myers, E.: Suffix arrays: a new method for on-line string searches. SIAM J. Comp., 935\u2013948 (1993)","DOI":"10.1137\/0222058"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"32","author":"E. McCreight","year":"1976","unstructured":"McCreight, E.: A space-economical suffix tree construction algorithm. J. ACM\u00a032(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1151","volume":"39","author":"I. Munro","year":"2001","unstructured":"Munro, I., Raman, V., Rao, S.: Space efficient suffix trees. J. Algor.\u00a039(2), 205\u2013222 (2001)","journal-title":"J. Algor."},{"issue":"1","key":"9_CR21","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G. Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comp. Surv.\u00a039(1), article 2 (2007)","journal-title":"ACM Comp. Surv."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proc. 9th ALENEX (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-92182-0_14","volume-title":"Algorithms and Computation","author":"S. Puglisi","year":"2008","unstructured":"Puglisi, S., Turpin, A.: Space-time tradeoffs for longest-common-prefix array computation. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 124\u2013135. Springer, Heidelberg (2008)"},{"key":"9_CR24","unstructured":"Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th SODA, pp. 233\u2013242 (2002)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-78773-0_32","volume-title":"LATIN 2008: Theoretical Informatics","author":"L. Russo","year":"2008","unstructured":"Russo, L., Navarro, G., Oliveira, A.: Fully-Compressed Suffix Trees. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 362\u2013373. Springer, Heidelberg (2008)"},{"issue":"2","key":"9_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. J. Algor.\u00a048(2), 294\u2013313 (2003)","journal-title":"J. Algor."},{"issue":"4","key":"9_CR27","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comp. Sys.\u00a041(4), 589\u2013607 (2007)","journal-title":"Theor. Comp. Sys."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proc. 21st SODA, pp. 134\u2013149 (2010)","DOI":"10.1137\/1.9781611973075.13"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-72845-0_17","volume-title":"Experimental Algorithms","author":"N. V\u00e4lim\u00e4ki","year":"2007","unstructured":"V\u00e4lim\u00e4ki, N., Gerlach, W., Dixit, K., M\u00e4kinen, V.: Engineering a compressed suffix tree implementation. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 217\u2013228. Springer, Heidelberg (2007)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: IEEE Symp. Swit. and Aut. Theo., pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:41Z","timestamp":1606186961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}