{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:43:50Z","timestamp":1740894230958,"version":"3.38.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"S11","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1186\/1471-2105-11-s11-s4","type":"journal-article","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T07:15:56Z","timestamp":1294298156000},"source":"Crossref","is-referenced-by-count":4,"title":["Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures"],"prefix":"10.1186","volume":"11","author":[{"given":"Yang","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Morihiro","family":"Hayashida","sequence":"additional","affiliation":[]},{"given":"Tatsuya","family":"Akutsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,14]]},"reference":[{"key":"4292_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","volume":"17","author":"M Li","year":"2001","unstructured":"Li M, Badger J, Chen X, Kwong S, Kearney P, Zhang H: An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics. 2001, 17: 149-154.","journal-title":"Bioinformatics"},{"key":"4292_CR2","first-page":"221","volume-title":"In Proc. 6th Asia-Pacific Bioinformatics Conference","author":"M Hayashida","year":"2008","unstructured":"Hayashida M, Akutsu T: Image compression-based approach to measuring the similarity of protein structures. In Proc. 6th Asia-Pacific Bioinformatics Conference. 2008, 221-230."},{"issue":"Supp 2","key":"4292_CR3","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1752-0509-4-S2-S13","volume":"4","author":"M Hayashida","year":"2010","unstructured":"Hayashida M, Akutsu T: Comparing biological networks via graph compression. BMC Systems Biology. 2010, 4 (Supp 2): S13-","journal-title":"BMC Systems Biology"},{"key":"4292_CR4","doi-asserted-by":"publisher","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 Transactions on Information Theory. 2005, 51: 2554-2576.","journal-title":"IEEE Transactions on Information Theory"},{"key":"4292_CR5","doi-asserted-by":"publisher","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. Theoretical Computer Science. 2003, 302: 211-222.","journal-title":"Theoretical Computer Science"},{"key":"4292_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1587\/transinf.E92.D.158","volume":"92-D","author":"H Sakamoto","year":"2009","unstructured":"Sakamoto H, Maruyama S, Kida T, Shimozono S: A space-saving approximation algorithm for grammar-based compression. IEICE Transactions on Information and Systems. 2009, 92-D: 158-165.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"4292_CR7","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.is.2008.01.004","volume":"33","author":"G Busatto","year":"2008","unstructured":"Busatto G, Lohrey M, Maneth S: Efficient memory representation of XML document trees. Information Systems. 2008, 33: 456-474.","journal-title":"Information Systems"},{"key":"4292_CR8","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/978-3-540-88411-8_27","volume-title":"In Proc. 11th Int. Conf. Discovery Science","author":"S Murakami","year":"2008","unstructured":"Murakami S, Doi K, Yamamoto A: Finding frequent patterns from compressed tree-structure data. In Proc. 11th Int. Conf. Discovery Science. 2008, 284-295."},{"key":"4292_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-39917-9_25","volume-title":"In Proc. 13th Int. Inductive Logic Programming","author":"K Yamagata","year":"2003","unstructured":"Yamagata K, Uchida T, Shoudai T, Nakamura Y: An effective grammar-based compression algorithm for tree structured data. In Proc. 13th Int. Inductive Logic Programming. 2003, 383-400."},{"key":"4292_CR10","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/j.ipl.2010.07.004","volume":"110","author":"T Akutsu","year":"2010","unstructured":"Akutsu T: A bisection algorithm for grammar-based compression of ordered trees. Information Processing Letters. 2010, 110: 815-820.","journal-title":"Information Processing Letters"},{"key":"4292_CR11","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.carres.2005.07.012","volume":"340","author":"Y Hizukuri","year":"2005","unstructured":"Hizukuri Y, Yamanishi Y, Nakamura O, Yagi F, Goto S, Kanehisa M: Extraction of leukemia specific glycan motifs in humans by computational glycomics. Carbohydrate Research. 2005, 340: 2270-2278.","journal-title":"Carbohydrate Research"},{"issue":"5","key":"4292_CR12","doi-asserted-by":"publisher","first-page":"63R","DOI":"10.1093\/glycob\/cwj010","volume":"16","author":"K Hashimoto","year":"2006","unstructured":"Hashimoto K, Goto S, Kawano S, Aoki-Kinoshita K, Ueda N, Hamajima M, Kawasaki T, Kanehisa M: KEGG as a glycome informatics resource. Glycobiology. 2006, 16 (5): 63R-70R.","journal-title":"Glycobiology"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-11-S11-S4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-11-S11-S4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-11-S11-S4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T13:11:16Z","timestamp":1740834676000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-11-S11-S4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":12,"journal-issue":{"issue":"S11","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["4292"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-11-s11-s4","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2010,12]]},"article-number":"S4"}}