{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:16:53Z","timestamp":1648880213943},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11786-016-0286-9","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T01:14:24Z","timestamp":1485998064000},"page":"191-196","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Block Graphs in Practice"],"prefix":"10.1007","volume":"11","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Hoobin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"key":"286_CR1","doi-asserted-by":"crossref","unstructured":"Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings. In: Proceedings of the 22nd Symposium on Discrete Algorithms (SODA), pp. 373\u2013389 (2011)","DOI":"10.1137\/1.9781611973082.30"},{"issue":"7","key":"286_CR2","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"20","key":"286_CR3","doi-asserted-by":"crossref","first-page":"2572","DOI":"10.1093\/bioinformatics\/btt460","volume":"29","author":"S Deorowicz","year":"2013","unstructured":"Deorowicz, S., Danek, A., Grabowski, S.: Genome compression: a novel approach for large collections. Bioinformatics 29(20), 2572\u20132578 (2013)","journal-title":"Bioinformatics"},{"issue":"21","key":"286_CR4","doi-asserted-by":"crossref","first-page":"2979","DOI":"10.1093\/bioinformatics\/btr505","volume":"27","author":"S Deorowicz","year":"2011","unstructured":"Deorowicz, S., Grabowski, S.: Robust relative compression of genomes with random access. Bioinformatics 27(21), 2979\u20132986 (2011)","journal-title":"Bioinformatics"},{"key":"286_CR5","doi-asserted-by":"crossref","unstructured":"Gagie, T., Gawrychowski, P., Puglisi, S.J.: Faster approximate pattern matching in compressed repetitive texts. In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 653\u2013662 (2011)","DOI":"10.1007\/978-3-642-25591-5_67"},{"key":"286_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-642-40273-9_14","volume-title":"Pace-Efficient Data Structures, Streams, and Algorithms","author":"R Grossi","year":"2013","unstructured":"Grossi, R.: Random access to high-order entropy compressed text. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Pace-Efficient Data Structures, Streams, and Algorithms, pp. 199\u2013215. Springer, Berlin (2013)"},{"key":"286_CR7","doi-asserted-by":"crossref","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. Comput. Sci. 483, 115\u2013133 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"286_CR8","doi-asserted-by":"crossref","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. In: Proceedings of the 17th Symposium on String Processing and Information Retrieval (SPIRE), pp. 201\u2013206 (2010)","DOI":"10.1007\/978-3-642-16321-0_20"},{"key":"286_CR9","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Optimized relative Lempel-Ziv compression of genomes. In: Proceedings of the 34th Australasian Computer Science Conference (ACSC), pp. 91\u201398 (2011)"},{"key":"286_CR10","doi-asserted-by":"crossref","unstructured":"Maruyama, S., Tabei, Y., Sakamoto, H., Sadakane, K.: Fully-online grammar compression. In: Proceedings of the 20th Symposium on String Processing and Information Retrieval (SPIRE), pp. 218\u2013229 (2013)","DOI":"10.1007\/978-3-319-02432-5_25"},{"key":"286_CR11","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) (2007)","DOI":"10.1137\/1.9781611972870.6"},{"issue":"4","key":"286_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"1\u20133","key":"286_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1\u20133), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"286_CR14","doi-asserted-by":"crossref","unstructured":"Verbin, E., Yu, W.: Data structure lower bounds on random access to grammar-compressed strings. In: Proceedings of the 24th Symposium on Combinatorial Pattern Matching (CPM), pp. 247\u2013258 (2013)","DOI":"10.1007\/978-3-642-38905-4_24"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-016-0286-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0286-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0286-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T05:58:13Z","timestamp":1495605493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-016-0286-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s11786-016-0286-9","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,2]]}}}