{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:27Z","timestamp":1759638327463},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_36","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"424-435","source":"Crossref","is-referenced-by-count":10,"title":["Faster Compressed Suffix Trees for Repetitive Text Collections"],"prefix":"10.1007","author":[{"given":"Gonzalo","family":"Navarro","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Ord\u00f3\u00f1ez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"36_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.3390\/a6020319","volume":"6","author":"A. Abeliuk","year":"2013","unstructured":"Abeliuk, A., C\u00e1novas, R., Navarro, G.: Practical compressed suffix trees. Algorithms\u00a06(2), 319\u2013351 (2013)","journal-title":"Algorithms"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-34109-0_5","volume-title":"String Processing and Information Retrieval","author":"A. Abeliuk","year":"2012","unstructured":"Abeliuk, A., Navarro, G.: Compressed suffix trees for repetitive texts. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 30\u201341. Springer, Heidelberg (2012)"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Apostolico, A.: The myriad virtues of subword trees. Combinatorial Algorithms on Words. NATO ISI Series, pp. 85\u201396. Springer (1985)","DOI":"10.1007\/978-3-642-82456-2_6"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., C\u00e1novas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Proc. ALENEX, pp. 84\u201397 (2010)","DOI":"10.1137\/1.9781611972900.9"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bille, P., Landau, G., Raman, R., Sadakane, K., Rao, S.S., Weimann, O.: Random access to grammar-compressed strings. In: Proc. SODA, pp. 373\u2013389 (2011)","DOI":"10.1137\/1.9781611973082.30"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ipm.2012.08.003","volume":"49","author":"N. Brisaboa","year":"2013","unstructured":"Brisaboa, N., Ladra, S., Navarro, G.: DACs: Bringing direct access to variable-length codes. Inf. Proc. Manag.\u00a049(1), 392\u2013404 (2013)","journal-title":"Inf. Proc. Manag."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-13193-6_9","volume-title":"Experimental Algorithms","author":"R. C\u00e1novas","year":"2010","unstructured":"C\u00e1novas, R., Navarro, G.: Practical compressed suffix trees. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 94\u2013105. Springer, Heidelberg (2010)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-34109-0_19","volume-title":"String Processing and Information Retrieval","author":"F. Claude","year":"2012","unstructured":"Claude, F., Navarro, G.: Improved grammar-based compressed indexes. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 180\u2013192. Springer, Heidelberg (2012)"},{"key":"36_CR9","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. INRIA (2007)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Do, H.-H., Jansson, J., Sadakane, K., Sung, W.-K.: Fast relative Lempel-Ziv self-index for similar sequences. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol.\u00a07285, pp. 291\u2013302. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29700-7_27"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.ipl.2010.02.010","volume":"110","author":"J. Fischer","year":"2010","unstructured":"Fischer, J.: Wee LCP. Inf. Proc. Lett.\u00a0110, 317\u2013320 (2010)","journal-title":"Inf. Proc. Lett."},{"issue":"51","key":"36_CR12","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":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-28332-1_21","volume-title":"Language and Automata Theory and Applications","author":"T. Gagie","year":"2012","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 240\u2013251. Springer, Heidelberg (2012)"},{"key":"36_CR14","unstructured":"Gog, S.: Compressed Suffix Trees: Design, Construction, and Applications. PhD thesis, Univ. of Ulm, Germany (2011)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2012.02.006","volume":"483","author":"S. Kreft","year":"2013","unstructured":"Kreft, S., Navarro, G.: On compressing and indexing repetitive sequences. Theor. Comp. Sci.\u00a0483, 115\u2013133 (2013)","journal-title":"Theor. Comp. Sci."},{"key":"36_CR17","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Optimized relative Lempel-Ziv compression of genomes. In: Proc. ACSC, CRPIT, vol.\u00a0113, pp. 91\u201398 (2011)"},{"issue":"11","key":"36_CR18","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"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: Tree structure compression with repair. In: Proc. DCC, pp. 353\u2013362 (2011)","DOI":"10.1109\/DCC.2011.42"},{"issue":"3","key":"36_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V. M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comp. Biol.\u00a017(3), 281\u2013308 (2010)","journal-title":"J. Comp. Biol."},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Manber, U., Myers, E.: Suffix arrays: a new method for on-line string searches. In: SIAM J. Comp., pp. 935\u2013948 (1993)","DOI":"10.1137\/0222058"},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-24727-2_26","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Maneth","year":"2004","unstructured":"Maneth, S., Busatto, G.: Tree transducers and tree compressions. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 363\u2013377. Springer, Heidelberg (2004)"},{"issue":"3","key":"36_CR23","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. J. ACM\u00a048(3), 407\u2013430 (2001)","journal-title":"J. ACM"},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-45061-0_29","volume-title":"Automata, Languages and Programming","author":"J. Munro","year":"2003","unstructured":"Munro, J., Raman, R., Raman, V., Srinivasa Rao, S.: Succinct representations of permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 345\u2013356. Springer, Heidelberg (2003)"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comp. Surv.\u00a039(1), article 2 (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"36_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-20662-7_17","volume-title":"Experimental Algorithms","author":"G. Navarro","year":"2011","unstructured":"Navarro, G., Puglisi, S., Valenzuela, D.: Practical compressed document retrieval. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 193\u2013205. Springer, Heidelberg (2011)"},{"key":"36_CR27","unstructured":"Ohlebusch, E.: Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag (2013)"},{"key":"36_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-16321-0_34","volume-title":"String Processing and Information Retrieval","author":"E. Ohlebusch","year":"2010","unstructured":"Ohlebusch, E., Fischer, J., Gog, S.: CST++. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 322\u2013333. Springer, Heidelberg (2010)"},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Russo, L., Navarro, G., Oliveira, A.: Fully-compressed suffix trees. ACM Trans. Alg.\u00a07(4), article 53 (2011)","DOI":"10.1145\/2000807.2000821"},{"issue":"4","key":"36_CR30","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":"36_CR31","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proc. SODA, pp. 134\u2013149 (2010)","DOI":"10.1137\/1.9781611973075.13"},{"key":"36_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-38905-4_23","volume-title":"Combinatorial Pattern Matching","author":"Y. Tabei","year":"2013","unstructured":"Tabei, Y., Takabatake, Y., Sakamoto, H.: A succinct grammar compression. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol.\u00a07922, pp. 235\u2013246. Springer, Heidelberg (2013)"},{"key":"36_CR33","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-319-07959-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T12:31:16Z","timestamp":1649334676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}