{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:56Z","timestamp":1725475016186},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_12","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"100-110","source":"Crossref","is-referenced-by-count":1,"title":["A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees"],"prefix":"10.1007","author":[{"given":"Kiyoko F.","family":"Aoki-Kinoshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minoru","family":"Kanehisa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Yang","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Turner, J.S.: Approximation algorithms for the shortest common superstring problem. Information and Computation, 1\u201320 (1989)","DOI":"10.1016\/0890-5401(89)90044-8"},{"key":"12_CR2","unstructured":"Teng, S., Yao, F.: Approximating shortest superstrings. In: Annual Symposium on Foundations of Computer Science (1993)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Weinard, M., Schnitger, G.: On the greedy superstring conjecture. In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, pp. 387\u2013398 (2003)","DOI":"10.1007\/978-3-540-24597-1_33"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2004.09.012","volume":"93","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Shafrir, N.: The greedy algorithm for shortest superstrings. Inf. Process. Lett.\u00a093, 13\u201317 (2005)","journal-title":"Inf. Process. Lett."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1145\/179812.179818","volume":"41","author":"A. Blum","year":"1994","unstructured":"Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. Journal of the ACM\u00a041, 630\u2013647 (1994)","journal-title":"Journal of the ACM"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z. Sweedyk","year":"1999","unstructured":"Sweedyk, Z.: A $2\\frac{1}{2}$ -approximation algorithm for shortest superstring. SIAM Journal of Computing\u00a029, 954\u2013986 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Armen, C., Stein, C.: A 2 2\/3-approximation algorithm for the shortest superstring problem. Combinatorial Pattern Matching, 87\u2013101 (1996)","DOI":"10.1007\/3-540-61258-0_8"},{"key":"12_CR8","doi-asserted-by":"crossref","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 (2005)","DOI":"10.1093\/glycob\/cwj010"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Aoki, K., Yamaguchi, A., Ueda, N., Akutsu, T., Mamitsuka, H., Goto, S., Kanehisa, M.: Kcam (kegg carbohydrate matcher): A software tool for analyzing the structures of carbohydrate sugar chains. Nucleic Acids Research, W267\u2013W272 (2004)","DOI":"10.1093\/nar\/gkh473"},{"key":"12_CR10","unstructured":"Aoki, K., Yamaguchi, A., Okuno, Y., Akutsu, T., Ueda, N., Kanehisa, M., Mamitsuka, H.: Efficient tree-matching methods for accurate carbohydrate database queries. In: Proceedings of the Fourteenth International Conference on Genome Informatics (Genome Informatics, 14), pp. 134\u2013143. Universal Academy Press (2003)"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1093\/bioinformatics\/bti193","volume":"8","author":"K.F. Aoki","year":"2005","unstructured":"Aoki, K.F., Mamitsuka, H., Akutsu, T., Kanehisa, M.: A score matrix to reveal the hidden links in glycans. Bioinformatics\u00a08, 1457\u20131463 (2005)","journal-title":"Bioinformatics"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1109\/TKDE.2005.117","volume":"17","author":"N. Ueda","year":"2005","unstructured":"Ueda, N., Aoki-Kinoshita, K.F., Yamaguchi, A., Akutsu, T., Mamitsuka, H.: A probabilistic model for mining labeled ordered trees: capturing patterns in carbohydrate sugar chains. IEEE Transactions on Knowledge and Data Engineering\u00a017, 1051\u20131064 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:42Z","timestamp":1619509782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11940128_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}