{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:27:42Z","timestamp":1725593262254},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_25","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"285-298","source":"Crossref","is-referenced-by-count":1,"title":["LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations, and multi-labeled trees. In: Proc. SODA, pp. 680\u2013689. ACM\/SIAM (2007)"},{"key":"25_CR2","unstructured":"Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: Proc. STACS, pp. 111\u2013122. IBFI Schloss Dagstuhl (2009)"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms\u00a057(2), 75\u201394 (2005)","journal-title":"J. Algorithms"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D. Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica\u00a043(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-15781-3_15","volume-title":"Algorithms \u2013 ESA 2010","author":"G.S. Brodal","year":"2010","unstructured":"Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06347, pp. 171\u2013182. Springer, Heidelberg (2010)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-30551-4_27","volume-title":"Algorithms and Computation","author":"K.-Y. Chen","year":"2004","unstructured":"Chen, K.-Y., Chao, K.-M.: On the range maximum-sum segment query problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 294\u2013305. Springer, Heidelberg (2004)"},{"key":"25_CR7","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Improved algorithms for the range next value problem and applications. In: Proc. STACS, pp. 205\u2013216. IBFI Schloss Dagstuhl (2008)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S., Verbin, E.: Sorting and selection in posets. In: Proc. SODA, pp. 392\u2013401. ACM\/SIAM (2009)","DOI":"10.1137\/1.9781611973068.44"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12200-2_16","volume-title":"LATIN 2010: Theoretical Informatics","author":"J. Fischer","year":"2010","unstructured":"Fischer, J.: Optimal succinctness for range minimum queries. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 158\u2013169. Springer, Heidelberg (2010)"},{"key":"25_CR10","first-page":"272","volume-title":"Proc. DCC","author":"J. Fischer","year":"2008","unstructured":"Fischer, J., Heun, V., St\u00fchler, H.M.: Practical entropy bounded schemes for O(1)-range minimum queries. In: Proc. DCC, pp. 272\u2013281. IEEE Press, Los Alamitos (2008)"},{"issue":"51","key":"25_CR11","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. Comput. Sci.\u00a0410(51), 5354\u20135364 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.tcs.2007.02.047","volume":"379","author":"A. G\u00e1l","year":"2007","unstructured":"G\u00e1l, A., Miltersen, P.B.: The cell probe complexity of succinct data structures. Theor. Comput. Sci.\u00a0379(3), 405\u2013417 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","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.\u00a0387(3), 348\u2013359 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR14","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. SODA, pp. 841\u2013850. ACM\/SIAM (2003)"},{"key":"25_CR15","doi-asserted-by":"publisher","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. Proceedings of the I.R.E.\u00a040, 1090\u20131101 (1952)","journal-title":"Proceedings of the I.R.E."},{"key":"25_CR16","first-page":"549","volume-title":"Proc. FOCS","author":"G. Jacobson","year":"1989","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proc. FOCS, pp. 549\u2013554. IEEE Computer Society, Los Alamitos (1989)"},{"key":"25_CR17","unstructured":"Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees. In: Proc. SODA, pp. 575\u2013584. ACM\/SIAM (2007)"},{"key":"25_CR18","series-title":"Sorting and Searching","volume-title":"Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Art of Computer Programming, 2nd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley Professional, Reading (1998)","edition":"2"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","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.\u00a0112(1), 37\u201350 (1994)","journal-title":"Inf. Comput."},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-75530-2_21","volume-title":"String Processing and Information Retrieval","author":"V. M\u00e4kinen","year":"2007","unstructured":"M\u00e4kinen, V., Navarro, G.: Implicit compression boosting with applications to self-indexing. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 229\u2013241. Springer, Heidelberg (2007)"},{"key":"25_CR21","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.I. Munro","year":"2003","unstructured":"Munro, J.I., Raman, R., Raman, V., Rao, S.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":"25_CR22","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys\u00a039(1), Article No. 2 (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"25_CR23","first-page":"305","volume-title":"Proc. FOCS","author":"M. P\u01cetra\u015fcu","year":"2008","unstructured":"P\u01cetra\u015fcu, M.: Succincter. In: Proc. FOCS, pp. 305\u2013313. IEEE Computer Society, Los Alamitos (2008)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. ACM Transactions on Algorithms\u00a03(4), Art.\u00a043 (2007)","DOI":"10.1145\/1290672.1290680"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proc. SODA, pp. 1230\u20131239. ACM\/SIAM (2006)","DOI":"10.1145\/1109557.1109693"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proc. SODA, pp. 134\u2013149. ACM\/SIAM (2010)","DOI":"10.1137\/1.9781611973075.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T12:04:34Z","timestamp":1560341074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}