{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:23:03Z","timestamp":1761675783057,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_32","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"371-382","source":"Crossref","is-referenced-by-count":13,"title":["Inferring a Graph from Path Frequency"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Daiji","family":"Fukagawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1006\/jcss.1995.1086","volume":"51","author":"T. Asano","year":"1995","unstructured":"Asano, T.: An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees. J. Computer and System Sciences\u00a051, 503\u2013510 (1995)","journal-title":"J. Computer and System Sciences"},{"key":"32_CR2","first-page":"449","volume":"16","author":"G.H. Bakir","year":"2004","unstructured":"Bakir, G.H., Weston, J., Sch\u00f6lkopf, B.: Learning to find pre-images. Advances in Neural Information Processing Systems\u00a016, 449\u2013456 (2004)","journal-title":"Advances in Neural Information Processing Systems"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-28649-3_31","volume-title":"Pattern Recognition","author":"G.H. Bakir","year":"2004","unstructured":"Bakir, G.H., Zien, A., Tsuda, K.: Learning to find graph pre-images. In: Rasmussen, C.E., B\u00fclthoff, H.H., Sch\u00f6lkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol.\u00a03175, pp. 253\u2013261. Springer, Heidelberg (2004)"},{"key":"32_CR4","first-page":"273","volume":"20","author":"C. Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support vector networks. Machine Learning\u00a020, 273\u2013297 (1995)","journal-title":"Machine Learning"},{"key":"32_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801389","volume-title":"An Introduction to Support Vector Machines and Other Kernel-based Learning Methods","author":"N. Cristianini","year":"2000","unstructured":"Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge Univ. Press, Cambridge (2000)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0020-0190(99)00054-X","volume":"70","author":"Y. Dinitz","year":"1999","unstructured":"Dinitz, Y., Itai, A., Rodeh, M.: On an algorithm of Zemlyachenko for subtree isomorphism. Information Processing Letters\u00a070, 141\u2013146 (1999)","journal-title":"Information Processing Letters"},{"key":"32_CR7","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"key":"32_CR8","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proc. 20th Int. Conf. Machine Learning, pp. 321\u2013328 (2003)"},{"key":"32_CR9","volume-title":"Topics in Graph Automorphisms and Reconstruction","author":"J. Lauri","year":"2003","unstructured":"Lauri, J., Scapellato, R.: Topics in Graph Automorphisms and Reconstruction. Cambridge Univ. Press, Cambridge (2003)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Leslie, C., Eskin, E., Noble, W.S.: The spectrum kernel: a string kernel for SVM protein classification. In: Proc. Pacific Symposium on Biocomputing, vol.\u00a07, pp. 564\u2013575 (2002)","DOI":"10.1142\/9789812799623_0053"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Mah\u00e9, P., Ueda, N., Akutsu, T., Perret, J.-L., Vert, J.-P.: Extensions of marginalized graph kernels. In: Proc. 21st Int. Conf. Machine Learning, pp. 552\u2013559 (2004)","DOI":"10.1145\/1015330.1015446"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(95)00156-5","volume":"161","author":"O. Maruyama","year":"1996","unstructured":"Maruyama, O., Miyano, S.: Inferring a tree from walks. Theoretical Computer Science\u00a0161, 289\u2013300 (1996)","journal-title":"Theoretical Computer Science"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1010072431120","volume":"1","author":"R.B. Nachbar","year":"2000","unstructured":"Nachbar, R.B.: Molecular evolution: automated manipulation of hierarchical chemical topology and its application to average molecular structures. Genetic Programming and Evolvable Machines\u00a01, 57\u201394 (2000)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"32_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology. An Algorithmic Approach","author":"P.A. Pevzner","year":"2000","unstructured":"Pevzner, P.A.: Computational Molecular Biology. An Algorithmic Approach. The MIT Press, Cambridge (2000)"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/S0022-0000(05)80089-3","volume":"49","author":"V. Raghavan","year":"1994","unstructured":"Raghavan, V.: Bounded degree graph inference from walks. J. Computer and System Sciences\u00a049, 108\u2013132 (1994)","journal-title":"J. Computer and System Sciences"},{"volume-title":"Kernel Methods in Computational Biology","year":"2004","key":"32_CR16","unstructured":"Sch\u00f6lkopf, B., Tsuda, K., Vert, J.-P. (eds.): Kernel Methods in Computational Biology. The MIT Press, Cambridge (2004)"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1021\/jm030809x","volume":"46","author":"H.M. Vinkers","year":"2003","unstructured":"Vinkers, H.M., de Jonge, M.R., Daeyaert, F.F.D., Heeres, J., Koymans, L.M.H., van Lenthe, J.H., Lewi, P.J., Timmerman, H., van Aken, K., Janssen, P.A.J.: Synopsis: synthesize and optimize system in silico. Journal of Medical Chemistry\u00a046, 2765\u20132773 (2003)","journal-title":"Journal of Medical Chemistry"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T02:18:23Z","timestamp":1740536303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11496656_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}