{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T11:25:28Z","timestamp":1777029928383,"version":"3.51.4"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,15]],"date-time":"2012-12-15T00:00:00Z","timestamp":1355529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00453-012-9726-3","type":"journal-article","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T21:17:38Z","timestamp":1355519858000},"page":"232-268","source":"Crossref","is-referenced-by-count":45,"title":["Efficient Fully-Compressed Sequence Representations"],"prefix":"10.1007","volume":"69","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Claude","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov","family":"Nekrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,15]]},"reference":[{"key":"9726_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-642-16321-0_5","volume-title":"Proc. 17th International Symposium on String Processing and Information Retrieval (SPIRE)","author":"D. Arroyuelo","year":"2010","unstructured":"Arroyuelo, D., Gonz\u00e1lez, S., Oyarz\u00fan, M.: Compressed self-indices supporting conjunctive queries on document collections. In: Proc. 17th International Symposium on String Processing and Information Retrieval (SPIRE), pp. 43\u201354 (2010)"},{"key":"9726_CR2","series-title":"LNCS","first-page":"170","volume-title":"Proc. 9th Latin American Symposium on Theoretical Informatics (LATIN)","author":"J. Barbay","year":"2010","unstructured":"Barbay, J., Claude, F., Navarro, G.: Compact rich-functional binary relation representations. In: Proc. 9th Latin American Symposium on Theoretical Informatics (LATIN). LNCS, vol. 6034, pp. 170\u2013183 (2010)"},{"issue":"3","key":"9726_CR3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.tcs.2007.07.015","volume":"387","author":"J. Barbay","year":"2007","unstructured":"Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3), 284\u2013297 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9726_CR4","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/2000807.2000820","volume":"7","author":"J. Barbay","year":"2011","unstructured":"Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms 7(4), 52 (2011)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"9726_CR5","first-page":"7","volume":"14","author":"J. Barbay","year":"2009","unstructured":"Barbay, J., L\u00f3pez-Ortiz, A., Lu, T., Salinger, A.: An experimental investigation of set intersection algorithms for text searching. ACM J. Exp. Algorithmics 14(3), 7 (2009)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"9726_CR6","first-page":"111","volume-title":"Proc. 26th Symposium on Theoretical Aspects of Computer Science (STACS)","author":"J. Barbay","year":"2009","unstructured":"Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: Proc. 26th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 111\u2013122 (2009)"},{"key":"9726_CR7","unstructured":"Barbay, J., Navarro, G.: On compressing permutations and adaptive sorting. CoRR (2011). 1108.4408v1"},{"key":"9726_CR8","series-title":"LNCS","first-page":"748","volume-title":"Proc. 19th Annual European Symposium on Algorithms (ESA)","author":"D. Belazzougui","year":"2011","unstructured":"Belazzougui, D., Navarro, G.: Alphabet-independent compressed text indexing. In: Proc. 19th Annual European Symposium on Algorithms (ESA). LNCS, vol. 6942, pp. 748\u2013759 (2011)"},{"key":"9726_CR9","series-title":"LNCS","first-page":"181","volume-title":"Proc. 20th Annual European Symposium on Algorithms (ESA)","author":"D. Belazzougui","year":"2012","unstructured":"Belazzougui, D., Navarro, G.: New lower and upper bounds for representing sequences. In: Proc. 20th Annual European Symposium on Algorithms (ESA). LNCS, vol. 7501, pp. 181\u2013192 (2012)"},{"key":"9726_CR10","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1145\/988672.988752","volume-title":"Proc. 13th World Wide Web Conference (WWW)","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: Proc. 13th World Wide Web Conference (WWW), pp. 595\u2013602 (2004)"},{"key":"9726_CR11","series-title":"LNCS","first-page":"297","volume-title":"Proc. 3rd International Workshop on Semantic and Conceptual Issues in GIS (SeCoGIS)","author":"N. Brisaboa","year":"2009","unstructured":"Brisaboa, N., Luaces, M., Navarro, G., Seco, D.: A new point access method based on wavelet trees. In: Proc. 3rd International Workshop on Semantic and Conceptual Issues in GIS (SeCoGIS). LNCS, vol. 5833, pp. 297\u2013306 (2009)"},{"key":"9726_CR12","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"key":"9726_CR13","unstructured":"Clark, D.: Compact Pat Trees. Ph.D. Thesis, University of Waterloo, Canada (1996)"},{"key":"9726_CR14","first-page":"388","volume-title":"Proc. 5th International Conference on Computer-Assisted Information Retrieval (RIAO)","author":"C. Clarke","year":"1997","unstructured":"Clarke, C., Cormack, G., Tudhope, E.: Relevance ranking for one to three term queries. In: Proc. 5th International Conference on Computer-Assisted Information Retrieval (RIAO), pp. 388\u2013401 (1997)"},{"key":"9726_CR15","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-540-89097-3_18","volume-title":"Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE)","author":"F. Claude","year":"2008","unstructured":"Claude, F., Navarro, G.: Practical rank\/select queries over arbitrary sequences. In: Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE), pp. 176\u2013187 (2008)"},{"key":"9726_CR16","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-12476-1_5","volume-title":"Algorithms and Applications (Ukkonen Festschrift)","author":"F. Claude","year":"2010","unstructured":"Claude, F., Navarro, G.: Extended compact web graph representations. In: Elomaa, T., Mannila, H., Orponen, P. (eds.) Algorithms and Applications (Ukkonen Festschrift). LNCS, vol. 6060, pp. 77\u201391. Springer, Berlin (2010)"},{"issue":"4","key":"9726_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1841909.1841913","volume":"4","author":"F. Claude","year":"2010","unstructured":"Claude, F., Navarro, G.: Fast and compact web graph representations. ACM Trans. Web 4(4), 16 (2010)","journal-title":"ACM Trans. Web"},{"key":"9726_CR18","first-page":"743","volume-title":"Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"E. Demaine","year":"2000","unstructured":"Demaine, E., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743\u2013752 (2000)"},{"issue":"1","key":"9726_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2094072.2094073","volume":"30","author":"A. Fari\u00f1a","year":"2012","unstructured":"Fari\u00f1a, A., Brisaboa, N., Navarro, G., Claude, F., Places, A., Rodr\u00edguez, E.: Word-based self-indexes for natural language text. ACM Trans. Inf. Syst. 30(1), 1 (2012)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"1","key":"9726_CR20","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1613676.1613680","volume":"57","author":"P. Ferragina","year":"2009","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57(1), 4 (2009)","journal-title":"J. ACM"},{"issue":"4","key":"9726_CR21","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed texts. J. ACM 52(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"issue":"2","key":"9726_CR22","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 Trans. Algorithms 3(2), 20 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"9726_CR23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2006.12.012","volume":"372","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372(1), 115\u2013121 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9726_CR24","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-642-03367-4_28","volume-title":"Proc. 11th International Symposium on Algorithms and Data Structures (WADS)","author":"T. Gagie","year":"2009","unstructured":"Gagie, T., Nekrich, Y.: Worst-case optimal adaptive prefix coding. In: Proc. 11th International Symposium on Algorithms and Data Structures (WADS). LNCS, vol. 5664, pp. 315\u2013326 (2009)"},{"issue":"3","key":"9726_CR25","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.tcs.2007.07.041","volume":"387","author":"A. Golynski","year":"2007","unstructured":"Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387(3), 348\u2013359 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9726_CR26","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/1.9781611973068.69","volume-title":"Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A. Golynski","year":"2009","unstructured":"Golynski, A.: Cell probe lower bounds for succinct data structures. In: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 625\u2013634 (2009)"},{"key":"9726_CR27","series-title":"LNCS","first-page":"371","volume-title":"Proc. 15th Annual European Symposium on Algorithms (ESA)","author":"A. Golynski","year":"2007","unstructured":"Golynski, A., Grossi, R., Gupta, A., Raman, R., Srinivasa Rao, S.: On the size of succinct indices. In: Proc. 15th Annual European Symposium on Algorithms (ESA). LNCS, vol. 4698, pp. 371\u2013382 (2007)"},{"key":"9726_CR28","first-page":"368","volume-title":"Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A. Golynski","year":"2006","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a tool for text indexing. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 368\u2013373 (2006)"},{"key":"9726_CR29","series-title":"LNCS","first-page":"148","volume-title":"Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT)","author":"A. Golynski","year":"2008","unstructured":"Golynski, A., Raman, R., Rao, S.: On the redundancy of succinct data structures. In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT). LNCS, vol. 5124, pp. 148\u2013159 (2008)"},{"key":"9726_CR30","first-page":"27","volume-title":"Proc. 4th Workshop on Efficient and Experimental Algorithms (WEA)","author":"R. Gonz\u00e1lez","year":"2005","unstructured":"Gonz\u00e1lez, R., Grabowski, Sz., M\u00e4kinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Proc. 4th Workshop on Efficient and Experimental Algorithms (WEA), pp. 27\u201338 (2005). Posters"},{"key":"9726_CR31","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/11780441_27","volume-title":"Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM)","author":"R. Gonz\u00e1lez","year":"2006","unstructured":"Gonz\u00e1lez, R., Navarro, G.: Statistical encoding of succinct data structures. In: Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 294\u2013305 (2006)"},{"key":"9726_CR32","first-page":"841","volume-title":"Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"R. Grossi","year":"2003","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":"9726_CR33","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1007\/978-3-642-14165-2_57","volume-title":"Proc. 37th International Colloquim on Automata, Languages and Programming (ICALP)","author":"R. Grossi","year":"2010","unstructured":"Grossi, R., Orlandi, A., Raman, R.: Optimal trade-offs for succinct string indexes. In: Proc. 37th International Colloquim on Automata, Languages and Programming (ICALP), pp. 678\u2013689 (2010)"},{"key":"9726_CR34","first-page":"517","volume-title":"Proc. 26th Symposium on Theoretical Aspects of Computer Science (STACS)","author":"R. Grossi","year":"2009","unstructured":"Grossi, R., Orlandi, A., Raman, R., Srinivasa Rao, S.: More haste, less waste: lowering the redundancy in fully indexable dictionaries. In: Proc. 26th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 517\u2013528 (2009)"},{"issue":"2","key":"9726_CR35","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R. Grossi","year":"2006","unstructured":"Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35(2), 378\u2013407 (2006)","journal-title":"SIAM J. Comput."},{"key":"9726_CR36","volume-title":"Digital Video: an Introduction to MPEG-2","author":"B. Haskel","year":"1997","unstructured":"Haskel, B., Puri, A., Netravali, A.: Digital Video: an Introduction to MPEG-2. Chapman & Hall, London (1997)"},{"key":"9726_CR37","volume-title":"Proc. 5th ACM Workshop on Social Network Mining and Analysis (SNA-KDD)","author":"C. Hern\u00e1ndez","year":"2011","unstructured":"Hern\u00e1ndez, C., Navarro, G.: Compression of web and social graphs supporting neighbor and community queries. In: Proc. 5th ACM Workshop on Social Network Mining and Analysis (SNA-KDD). ACM, New York (2011)"},{"key":"9726_CR38","first-page":"730","volume-title":"Proc. 17th European Symposium on Algorithms (ESA)","author":"J.B. Hreinsson","year":"2009","unstructured":"Hreinsson, J.B., Kr\u00f8yer, M., Pagh, R.: Storing a compressed function with constant time access. In: Proc. 17th European Symposium on Algorithms (ESA), pp. 730\u2013741 (2009)"},{"issue":"9","key":"9726_CR39","doi-asserted-by":"crossref","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. IRE 40(9), 1090\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"1","key":"9726_CR40","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1006\/inco.1994.1050","volume":"112","author":"C. Levcopoulos","year":"1994","unstructured":"Levcopoulos, C., Petersson, O.: Sorting shuffled monotone sequences. Inf. Comput. 112(1), 37\u201350 (1994)","journal-title":"Inf. Comput."},{"issue":"3","key":"9726_CR41","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.tcs.2007.07.013","volume":"387","author":"V. M\u00e4kinen","year":"2007","unstructured":"M\u00e4kinen, V., Navarro, G.: Rank and select revisited and extended. Theor. Comput. Sci. 387(3), 332\u2013347 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9726_CR42","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/1367064.1367072","volume":"4","author":"V. M\u00e4kinen","year":"2008","unstructured":"M\u00e4kinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Algorithms 4(3), 32 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"9726_CR43","doi-asserted-by":"crossref","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 48(3), 407\u2013430 (2001)","journal-title":"J. ACM"},{"key":"9726_CR44","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-09118-1_22","volume-title":"Proc. 4th GI-Conference on Theoretical Computer Science","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Sorting presorted files. In: Proc. 4th GI-Conference on Theoretical Computer Science. LNCS, vol. 67, pp. 199\u2013212 (1979)"},{"issue":"10","key":"9726_CR45","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/26.634683","volume":"45","author":"A. Moffat","year":"1997","unstructured":"Moffat, A., Turpin, A.: On the implementation of minimum-redundancy prefix codes. IEEE Trans. Commun. 45(10), 1200\u20131207 (1997)","journal-title":"IEEE Trans. Commun."},{"key":"9726_CR46","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Proc. 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","author":"I. Munro","year":"1996","unstructured":"Munro, I.: Tables. In: Proc. 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). LNCS, vol. 1180, pp. 37\u201342 (1996)"},{"key":"9726_CR47","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2012.03.005","volume":"438","author":"I. Munro","year":"2012","unstructured":"Munro, I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations and functions. Theor. Comput. Sci. 438, 74\u201388 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9726_CR48","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 Comput. Surv. 39(1), 2 (2007)","journal-title":"ACM Comput. Surv."},{"key":"9726_CR49","doi-asserted-by":"crossref","unstructured":"Navarro, G., Nekrich, Y.: Optimal dynamic sequence representations. In: Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2013, to appear)","DOI":"10.1137\/1.9781611973105.62"},{"key":"9726_CR50","first-page":"60","volume-title":"Proc. 10th Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"D. Okanohara","year":"2007","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proc. 10th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 60\u201370 (2007)"},{"issue":"11","key":"9726_CR51","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1109\/TCSVT.2004.835150","volume":"14","author":"W. Pearlman","year":"2004","unstructured":"Pearlman, W., Islam, A., Nagaraj, N., Said, A.: Efficient, low-complexity image coding with a set-partitioning embedded block coder. IEEE Trans. Circuits Syst. Video Technol. 14(11), 1219\u20131235 (2004)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"9726_CR52","volume-title":"JPEG: Still Image Data Compression Standard","author":"W. Pennebaker","year":"1992","unstructured":"Pennebaker, W., Mitchell, J.: JPEG: Still Image Data Compression Standard. Van Nostrand-Reinhold, New York (1992)"},{"key":"9726_CR53","first-page":"305","volume-title":"Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. P\u0103tra\u015fcu","year":"2008","unstructured":"P\u0103tra\u015fcu, M.: Succincter. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 305\u2013313 (2008)"},{"key":"9726_CR54","unstructured":"P\u0103tra\u015fcu, M.: A lower bound for succinct rank queries. CoRR (2009). arXiv:0907.1103v1 [cs.DS]"},{"issue":"4","key":"9726_CR55","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R. Raman","year":"2007","unstructured":"Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"9726_CR56","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.3390\/a2031105","volume":"2","author":"L. Russo","year":"2009","unstructured":"Russo, L., Navarro, G., Oliveira, A., Morales, P.: Approximate string matching with compressed indexes. Algorithms 2(3), 1105\u20131136 (2009)","journal-title":"Algorithms"},{"issue":"2","key":"9726_CR57","doi-asserted-by":"crossref","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. Algorithms 48(2), 294\u2013313 (2003)","journal-title":"J. Algorithms"},{"key":"9726_CR58","first-page":"1230","volume-title":"Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"K. Sadakane","year":"2006","unstructured":"Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1230\u20131239 (2006)"},{"key":"9726_CR59","first-page":"193","volume-title":"Proc. 15th Data Compression Conference (DCC)","author":"A. Said","year":"2005","unstructured":"Said, A.: Efficient alphabet partitioning algorithms for low-complexity entropy coding. In: Proc. 15th Data Compression Conference (DCC), pp. 193\u2013202 (2005)"},{"issue":"2","key":"9726_CR60","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM 31(2), 245\u2013281 (1984)","journal-title":"J. ACM"},{"key":"9726_CR61","volume-title":"Managing Gigabytes","author":"I. Witten","year":"1999","unstructured":"Witten, I., Moffat, A., Bell, T.: Managing Gigabytes, 2nd edn. Morgan Kaufmann, San Mateo (1999)","edition":"2"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9726-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9726-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9726-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T03:06:15Z","timestamp":1562468775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9726-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,15]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9726"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9726-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,15]]}}}