{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:20Z","timestamp":1725487280091},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_11","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"115-126","source":"Crossref","is-referenced-by-count":2,"title":["2D-Structure Drawings of Similar Molecules"],"prefix":"10.1007","author":[{"given":"J. D.","family":"Boissonnat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Cazals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Fl\u00f6totto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Tatsuya Akutsu and Magn\u00fas M. Halld\u00f3rsson. On the approximation of largest common subtrees and largest common point sets. Theoretical Computer Science, to appear 2000.","key":"11_CR1","DOI":"10.1016\/S0304-3975(97)00278-8"},{"doi-asserted-by":"crossref","unstructured":"Jean-Daniel Boissonnat, Fr\u00e9deric Cazals, and Julia Fl\u00f6totto. 2d-structure drawings of similar molecules. Technical report, INRIA Sophia Antipolis, to appear 2000.","key":"11_CR2","DOI":"10.1007\/3-540-44541-2_11"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1021\/ci60006a011","volume":"16","author":"R. E. Carhart","year":"1976","unstructured":"Raymond E. Carhart. A model-based approach to the teletype printing of chemical structures. Journal of Chemical Information and Computer Sciences, 16:82\u201388, 1976.","journal-title":"Journal of Chemical Information and Computer Sciences"},{"doi-asserted-by":"crossref","unstructured":"F. Cazals. Effective nearest neighbours searching on the hyper-cube, with applications to molecular clustering. In 14th ACM Symposium on Computational Geometry, pages 222\u2013230, 1998.","key":"11_CR4","DOI":"10.1145\/276884.276910"},{"unstructured":"G. di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing. Prentice Hall, 1999.","key":"11_CR5"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J. R. Driscoll","year":"1989","unstructured":"J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38:86\u2013124, 1989.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(97)84223-5","volume":"169","author":"P. Eades","year":"1996","unstructured":"Peter Eades and Sue Whitesides. The logic engine and the realization problem for nearest neighbor graphs. Theor. Comput. Sci., 169(1):23\u201337, 1996.","journal-title":"Theor. Comput. Sci."},{"key":"11_CR8","first-page":"55","volume-title":"Computer Representation and Manipulation of Chemical Information","year":"1974","unstructured":"R. J. Feldmann, S. R. Heller, E. Hyde, and W. T. Wipke (Ed.). Computer Representation and Manipulation of Chemical Information, pages 55\u201360. Wiley, New York, 1974."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/PL00009212","volume":"21","author":"A. Gupta","year":"1998","unstructured":"A. Gupta and N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21:183\u2013210, 1998.","journal-title":"Algorithmica"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0169-7439(93)80019-E","volume":"20","author":"D. B. Hibbert","year":"1993","unstructured":"D. Brynn Hibbert. Generation and display of chemical structures by genetic algorithms. Chemometrics and Intelligent Laboratory Systems, 20:35\u201343, 1993.","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"unstructured":"M. Himsolt. Gml: A portable graph file format. Technical report, Universit\u00e4t Passau, 1997. cf. http:\/\/www.fmi.uni-passau.de\/himsolt\/Graphlet\/GML .","key":"11_CR11"},{"unstructured":"D. R. Musser and Atul Saini. STL Tutorial and Reference Guide. Addison-Wesley Publishing Company, 1995.","key":"11_CR12"},{"unstructured":"V. Nicholson, C.-C. Tsai, M. Johnson, and M. Naim. A subgraph isomorphism theorem for molecular graphs. In Graph theory and topology in chemistry, Collect. Pap. Int. Conf., volume 51 of Stud. Phys. Theor. Chem., pages 226\u2013230, Athens\/GA, 1987.","key":"11_CR13"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1021\/ci00038a002","volume":"23","author":"C. A. Shelley","year":"1983","unstructured":"Craig A. Shelley. Heuristic approach for displaying chemical structures. J. Chem. Inf. Comput. Sci., 23:61\u201365, 1983.","journal-title":"J. Chem. Inf. Comput. Sci."},{"unstructured":"J. van Leeuwen (Ed.). Handbook of Theoretical Computer Science, volume A. Elsevier, 1990.","key":"11_CR15"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:19:20Z","timestamp":1556680760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}