{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T02:42:15Z","timestamp":1790044935930,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540260769","type":"print"},{"value":"9783540319351","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_93","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T02:06:46Z","timestamp":1283825206000},"page":"791-801","source":"Crossref","is-referenced-by-count":12,"title":["Cyclic Pattern Kernels Revisited"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"93_CR1","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"C. Barrett","year":"2000","unstructured":"Barrett, C., Jacob, R., Marathe, M.: Formal-language-constrained path problems. SIAM Journal on Computing\u00a030(3), 809\u2013837 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"93_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011(1-2), 1\u201322 (1993)","journal-title":"Acta Cybernetica"},{"issue":"1\u20132","key":"93_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209(1\u20132), 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"7","key":"93_CR4","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"A. Bradley","year":"1997","unstructured":"Bradley, A.: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition\u00a030(7), 1145\u20131159 (1997)","journal-title":"Pattern Recognition"},{"key":"93_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/ICDM.2003.1250900","volume-title":"Proc. of the 3rd IEEE Int. Conf. on Data Mining","author":"M. Deshpande","year":"2003","unstructured":"Deshpande, M., Kuramochi, M., Karypis, G.: Frequent sub-structure based approaches for classifying chemical compounds. In: Proc. of the 3rd IEEE Int. Conf. on Data Mining, pp. 35\u201342. IEEE Computer Society, Los Alamitos (2003)"},{"key":"93_CR6","volume-title":"Graph theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph theory, 2nd edn. Springer, New York (2000)","edition":"2"},{"issue":"4","key":"93_CR7","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1137\/S0097539703427203","volume":"33","author":"Grohe Flum","year":"2004","unstructured":"Flum, Grohe: The parameterized complexity of counting problems. SIAM Journal on Computing 33(4), 892\u2013922 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"93_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T. G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T.: A survey of kernels for structured data. SIGKDD Explorations\u00a05(1), 49\u201358 (2003)","journal-title":"SIGKDD Explorations"},{"key":"93_CR9","unstructured":"Gleiss, P.M., Stadler, P.F.: Relevant cycles in biopolymers and random graph. In: Proc. of the 4th Slovene Int. Conf. in Graph Theory (1999)"},{"key":"93_CR10","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., G\u00e4rtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: Proc. of the 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 158\u2013167 (2004)","DOI":"10.1145\/1014052.1014072"},{"key":"93_CR11","first-page":"169","volume-title":"Advances in Kernel Methods \u2014 Support Vector Learning","author":"T. Joachims","year":"1999","unstructured":"Joachims, T.: Making large\u2013scale SVM learning practical. In: Sch\u00f6lkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods \u2014 Support Vector Learning, pp. 169\u2013184. MIT Press, Cambridge (1999)"},{"key":"93_CR12","volume-title":"Elements of the Theory of Computation","author":"H. Lewis","year":"1997","unstructured":"Lewis, H., Papadimitriou, C.: Elements of the Theory of Computation, 2nd edn. Prentice Hall, New York (1997)","edition":"2"},{"issue":"6","key":"93_CR13","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"A.O. Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM Journal on Computing\u00a024(6), 1235\u20131258 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"93_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1021\/c160040a013","volume":"11","author":"M. Plotkin","year":"1971","unstructured":"Plotkin, M.: Mathematical basis of ring-finding algorithms at CIDS. J. Chem. Doc.\u00a011, 60\u201363 (1971)","journal-title":"J. Chem. Doc."},{"issue":"3","key":"93_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R.C. Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks\u00a05(3), 237\u2013252 (1975)","journal-title":"Networks"},{"issue":"3","key":"93_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"93_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J. Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"93_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"93_CR19","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"93_CR20","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. John Wiley, Chichester (1998)"},{"issue":"1","key":"93_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.37236\/1294","volume":"4","author":"P. Vismara","year":"1997","unstructured":"Vismara, P.: Union of all the minimum cycle bases of a graph. The Electronic Journal of Combinatorics\u00a04(1), 73\u201387 (1997)","journal-title":"The Electronic Journal of Combinatorics"},{"key":"93_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/775047.775058","volume-title":"Proc. of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"M. Zaki","year":"2002","unstructured":"Zaki, M.: Efficiently mining frequent trees in a forest. In: Proc. of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 71\u201380. ACM Press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11430919_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:11:11Z","timestamp":1619493071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11430919_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}