{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:50Z","timestamp":1725664190064},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_205","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:44:50Z","timestamp":1330271090000},"page":"405-413","source":"Crossref","is-referenced-by-count":5,"title":["On the approximation of largest common subtrees and largest common point sets"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"no.1","key":"47_CR1","first-page":"95","volume":"E75-D","author":"T. Akutsu","year":"1992","unstructured":"T. Akutsu. An RNC algorithm for finding a largest common subtree of two trees. IEICE Transactions on Information and Systems, vol. E75-D, no. 1, pp. 95\u2013101, Jan. 1992","journal-title":"IEICE Transactions on Information and Systems"},{"key":"47_CR2","unstructured":"T. Akutsu. On determining the congruity of point sets in higher dimensions. These proceedings."},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33rd IEEE Symp. on Foundations of Computer Science, pp. 14\u201323, Oct. 1992","DOI":"10.1109\/SFCS.1992.267823"},{"issue":"no.4","key":"47_CR4","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01840398","volume":"5","author":"B. Berger","year":"1990","unstructured":"B. Berger and J. Rompel. A better performance guarantee for approximate graph coloring. Algorithmica, vol. 5, no. 4, pp. 459\u2013466, 1990.","journal-title":"Algorithmica"},{"key":"47_CR5","volume-title":"Introduction to Protein Structure","author":"C. Branden","year":"1991","unstructured":"C. Branden and J. Tooze. Introduction to Protein Structure, Garland Publishing Inc., New York, 1991"},{"key":"47_CR6","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability, Freeman, New York, 1979"},{"key":"47_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0020-0190(93)90246-6","volume":"45","author":"M. M. Halld\u00f3rsson","year":"1993","unstructured":"M. M. Halld\u00f3rsson. A still better performance guarantee for approximate graph coloring. Inform. Process. Lett., vol. 45, pp. 19\u201323, 25 January 1993.","journal-title":"Inform. Process. Lett."},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"R. Maier","year":"1978","unstructured":"R. Maier. The complexity of some problems on subsequences and supersequences. J. ACM, vol. 25, pp. 322\u2013336, 1978","journal-title":"J. ACM"},{"issue":"no.3","key":"47_CR9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. Papadimitriou","year":"1991","unstructured":"C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Computer and System. Sciences, vol. 43, no. 3, pp. 425\u2013440, Dec. 1991","journal-title":"J. Computer and System. Sciences"},{"key":"47_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/prot.340140216","volume":"14","author":"R. B. Russel","year":"1992","unstructured":"R. B. Russel and G. J. Barton. Multiple protein sequence alignment from tertiary structure comparison: assignment of global and residue confidence levels. PROTEINS: Structure, Function, and Genetics, vol. 14, pp. 309\u2013323, 1992","journal-title":"PROTEINS: Structure, Function, and Genetics"},{"key":"47_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.2116\/analsci.3.23","volume":"3","author":"Y. Takahashi","year":"1987","unstructured":"Y. Takahashi, Y. Satoh, H. Suzuki and S. Sasaki. Recognition of largest common structural fragment among a variety of chemical structures. Analytical Sciences, vol. 3, pp.23\u201328, 1987.","journal-title":"Analytical Sciences"},{"key":"47_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/prot.340110107","volume":"11","author":"G. Vriend","year":"1991","unstructured":"G. Vriend and C Sander. Detection of common three-dimensional substructures in proteins. PROTEINS: Structure, Function, and Genetics, vol. 11, pp. 52\u201358, 1991","journal-title":"PROTEINS: Structure, Function, and Genetics"},{"key":"47_CR13","unstructured":"K. Zhang and T. Jiang. Some MAX SNP-hard results concerning unordered labeled trees. To appear in Information Processing Letters."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_205.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:13:40Z","timestamp":1619572420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_205","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}