{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T06:33:35Z","timestamp":1719556415351},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,23]],"date-time":"2012-10-23T00:00:00Z","timestamp":1350950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s11047-012-9349-2","type":"journal-article","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T05:15:46Z","timestamp":1350882946000},"page":"589-603","source":"Crossref","is-referenced-by-count":1,"title":["On computational complexity of graph inference from counting"],"prefix":"10.1007","volume":"12","author":[{"given":"Szil\u00e1rd Zsolt","family":"Fazekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasushi","family":"Okuno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kei","family":"Taneishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,23]]},"reference":[{"key":"9349_CR1","first-page":"371","volume-title":"CPM 2005, Lecture Notes in Computer Science, vol 3537.","author":"T Akutsu","year":"2005","unstructured":"Akutsu T, Fukagawa D (2005) Inferring a graph from path frequency. In: Aposolico A, Crochemore M, Park K (eds) CPM 2005. Lecture notes in computer science, vol 3537. Springer, New York, pp 371\u2013382"},{"key":"9349_CR2","unstructured":"Bakir GH, Weston J, Sch\u00f6lkopf B (2004a) Learning to find pre-images. In: Advances in neural information processing systems, pp 449\u2013456"},{"key":"9349_CR3","doi-asserted-by":"crossref","unstructured":"Bakir GH, Zien A, Tsuda K (2004b) Learning to find graph pre-images. In: Proceedings of the 26th DAGM symposium. Lecture notes in computer science, vol 3175, Springer, New York, pp 253\u2013261","DOI":"10.1007\/978-3-540-28649-3_31"},{"issue":"1\u20132","key":"9349_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H Bodlaender","year":"1998","unstructured":"Bodlaender H (1998) A partial k-arboretum of graphs with bounded treewidth. Theor Comput Sci 209(1\u20132): 1\u201345","journal-title":"Theor Comput Sci"},{"key":"9349_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory, 4th Edition","author":"R Diestel","year":"2010","unstructured":"Diestel R (2010) Graph theory, 4th edn. Springer, New York"},{"key":"9349_CR6","doi-asserted-by":"crossref","unstructured":"Fraigniaud P, Nisse N (2006) Connected treewidth and connected graph searching. In: LATIN 2006. Lecture notes in computer science, vol 3887, Springer, New York, pp 479\u2013490","DOI":"10.1007\/11682462_45"},{"key":"9349_CR7","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1021\/ci700385a","volume":"48","author":"H Fujiwara","year":"2008","unstructured":"Fujiwara H et\u00a0al. (2008) Enumerating treelike chemical graphs with given path frequency. J Chem Inf Model 48:1345\u20131357","journal-title":"J Chem Inf Model"},{"key":"9349_CR8","unstructured":"Garey M R, Johnson D S (1979) Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Co, New York"},{"key":"9349_CR9","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1093\/nar\/30.1.402","volume":"30","author":"S Goto","year":"2002","unstructured":"Goto S et\u00a0al (2002) LIGAND: Database of chemical compounds and reactions in biological pathways. Nucleic Acids Res 30:402\u2013404","journal-title":"Nucleic Acids Res"},{"key":"9349_CR10","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra OH (1978) Reversal-bounded multicounter machines and their decision problems. J ACM 25:116\u2013133","journal-title":"J ACM"},{"key":"9349_CR11","unstructured":"Leslie C, Eskin E, Noble WS (2002) The spectrum kernel: a string kernel for SVM protein classification. In: Proceedings of the 7th Pacific symposium on biocomputing. pp 564\u2013575"},{"key":"9349_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2003.04.001","volume":"68","author":"A Mateescu","year":"2004","unstructured":"Mateescu A, Salomaa A, Yu S (2004) Subword histories and Parikh matrices. J Comput Syst Sci 68:1\u201321","journal-title":"J. Comput. Syst. Sci."},{"key":"9349_CR13","first-page":"83","volume":"21","author":"Y Matiyasevich","year":"1970","unstructured":"Matiyasevich Y (1970) Solution of the tenth problem of Hilbert. Matematikai Lapok 21:83\u201387","journal-title":"Matematikai Lapok"},{"key":"9349_CR14","unstructured":"Matiyasevich Y (1993) Hilbert\u2019s tenth problem. MIT Press, Cambridge"},{"key":"9349_CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00453-008-9184-0","volume":"53","author":"H Nagamochi","year":"2009","unstructured":"Nagamochi H (2009) A detachment algorithm for inferring a graph from path frequency. Algorithmica 53:207\u2013224","journal-title":"Algorithmica"},{"key":"9349_CR16","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh RJ (1966) On context-free languages. J Assoc Comput Mach 13:570\u2013581","journal-title":"J Assoc Comput Mach"},{"key":"9349_CR17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson N, Seymour PD (1986) Graph minors. ii. algorithmic aspects of tree-width. J Algor 7:309\u2013322","journal-title":"Journal of Algorithms"},{"key":"9349_CR18","doi-asserted-by":"crossref","unstructured":"Rozenberg G, Salomaa A (eds). (1997) Handbook of formal languages, vol 1. Springer, New York","DOI":"10.1007\/978-3-642-59126-6"},{"key":"9349_CR19","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.tcs.2011.10.017","volume":"418","author":"S Seki","year":"2011","unstructured":"Seki S (2011) Absoluteness of subword inequality is undecidable. Theor Comput Sci 418:116-120","journal-title":"Theor Comput Sci"},{"key":"9349_CR20","unstructured":"Shannon CS, Weaver W (1949) The mathematical theory of communication. The University of Illinois Press, Urbana"},{"key":"9349_CR21","first-page":"376","volume":"14","author":"A Yamaguchi","year":"2003","unstructured":"Yamaguchi A, Aoki KF, Mamitsuka H (2003) Graph complexity of chemical compounds in biological pathways. Genome Inform 14:376\u2013377","journal-title":"Genome Informatics"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-012-9349-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-012-9349-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-012-9349-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T21:32:57Z","timestamp":1562275977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-012-9349-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,23]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9349"],"URL":"https:\/\/doi.org\/10.1007\/s11047-012-9349-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,23]]}}}