{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:43:37Z","timestamp":1742985817431,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208461"},{"type":"electronic","value":"9783642208478"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20847-8_3","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:32:11Z","timestamp":1306488731000},"page":"26-37","source":"Crossref","is-referenced-by-count":0,"title":["LGM: Mining Frequent Subgraphs from Linear Graphs"],"prefix":"10.1007","author":[{"given":"Yasuo","family":"Tabei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daisuke","family":"Okanohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuichi","family":"Hirose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Tsuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45681-3_1","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"K. Abe","year":"2002","unstructured":"Abe, K., Kawasoe, S., Asai, T., Arimura, H., Arikawa, S.: Optimized substructure discovery for semi-structured data. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 1\u201314. Springer, Heidelberg (2002)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math.\u00a065, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.tcs.2006.09.013","volume":"368","author":"E. Davydov","year":"2006","unstructured":"Davydov, E., Batzoglou, S.: A computational model for RNA multiple sequence alignment. Theoretical Computer Science\u00a0368, 205\u2013216 (2006)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-87479-9_40","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"F. Eichinger","year":"2008","unstructured":"Eichinger, F., B\u00f6hm, K., Huber, M.: Mining edge-weighted call graphs to localise software bugs. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, pp. 333\u2013348. Springer, Heidelberg (2008)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-73437-6_25","volume-title":"Combinatorial Pattern Matching","author":"G. Fertin","year":"2007","unstructured":"Fertin, G., Hermelin, D., Rizzi, R., Vialette, S.: Common structured patterns in linear graphs: Approximation and combinatorics. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 241\u2013252. Springer, Heidelberg (2007)"},{"issue":"7","key":"3_CR6","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1093\/bioinformatics\/btp080","volume":"25","author":"E. Georgii","year":"2009","unstructured":"Georgii, E., Dietmann, S., Uno, T., Pagel, P., Tsuda, K.: Enumeration of condition-dependent dense modules in protein interaction networks. Bioinformatics\u00a025(7), 933\u2013940 (2009)","journal-title":"Bioinformatics"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1093\/bioinformatics\/btm345","volume":"23","author":"A.V. Glyakina","year":"2007","unstructured":"Glyakina, A.V., Garbuzynskiy, S.O., Lobanov, M.Y., Galzitskaya, O.V.: Different packing of external residues can explain differences in the thermostability of proteins from thermophilic and mosophilic organisms. Bioinformatics\u00a023, 2231\u20132238 (2007)","journal-title":"Bioinformatics"},{"key":"3_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM 2001), pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jmbi.1999.2911","volume":"291","author":"L.A. Mirny","year":"1999","unstructured":"Mirny, L.A., Shakhnovich, E.I.: Universally Conserved Positions in Protein Folds: Reading Evolutionary Signals about Stability, Folding Kinetics and Function. Journal of Molecular Biology\u00a0291, 177\u2013196 (1999)","journal-title":"Journal of Molecular Biology"},{"key":"3_CR11","unstructured":"Miyao, Y., S\u00e6tre, R., Sagae, K., Matsuzaki, T., Tsujii, J.: Task-oriented evaluation of syntactic parsers and their representations. In: 46th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 46\u201354 (2008)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Tsuda, K.: Frequent subgraph retrieval in geometric graph databases. In: Perner, P. (ed.) ICDM 2008. LNCS (LNAI), vol.\u00a05077, pp. 953\u2013958. Springer, Heidelberg (2008)","DOI":"10.1109\/ICDM.2008.38"},{"key":"3_CR13","volume-title":"IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR)","author":"S. Nowozin","year":"2007","unstructured":"Nowozin, S., Tsuda, K., Uno, T., Kudo, T., Bakir, G.: Weighted substructure mining for image analysis. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society, Los Alamitos (2007)"},{"issue":"11","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J. Pei","year":"2004","unstructured":"Pei, J., Han, J., Mortazavi-asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Transactions on Knowledge and Data Engineering\u00a016(11), 1424\u20131440 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10994-008-5089-z","volume":"75","author":"H. Saigo","year":"2008","unstructured":"Saigo, H., Nowozin, S., Kadowaki, T., Taku, K., Tsuda, K.: gBoost: a mathematical programming approach to graph classification and regression. Machine Learning\u00a075, 69\u201389 (2008)","journal-title":"Machine Learning"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 77\u201386 (2005)","DOI":"10.1145\/1133905.1133916"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Wale, N., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. In: Proceedings of the 2006 IEEE International Conference on Data Mining, pp. 678\u2013689 (2006)","DOI":"10.21236\/ADA444816"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 433\u2013444 (2008)","DOI":"10.1145\/1376616.1376662"},{"key":"3_CR19","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pp. 721\u2013724 (2002)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Proceedings of 2003 International Conference on Knowledge Discovery and Data Mining (SIGKDD 2003), pp. 286\u2013295 (2003)","DOI":"10.1145\/956750.956784"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20847-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T21:34:54Z","timestamp":1741210494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20847-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208461","9783642208478"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20847-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}