{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:12:54Z","timestamp":1759133574618},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,2,27]],"date-time":"2011-02-27T00:00:00Z","timestamp":1298764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10618-011-0217-y","type":"journal-article","created":{"date-parts":[[2011,2,26]],"date-time":"2011-02-26T03:11:42Z","timestamp":1298689902000},"page":"503-548","source":"Crossref","is-referenced-by-count":10,"title":["All normalized anti-monotonic overlap graph measures are bounded"],"prefix":"10.1007","volume":"23","author":[{"given":"Toon","family":"Calders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dries","family":"Van Dyck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,27]]},"reference":[{"issue":"3","key":"217_CR1","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1101\/gr.4526006","volume":"16","author":"S Bandyopadhyay","year":"2006","unstructured":"Bandyopadhyay S, Sharan R, Ideker T (2006) Systematic identification of functional orthologs based on protein network comparison. Genome Res 16(3): 428\u2013435","journal-title":"Genome Res"},{"key":"217_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs","author":"B Bolobas","year":"2001","unstructured":"Bolobas B (2001) Random graphs. Cambridge University Press, Cambridge"},{"key":"217_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.endm.2004.03.022","volume":"17","author":"Valentin E Brimkov","year":"2004","unstructured":"Brimkov Valentin E (2004) Clique, chromatic, and lovasz numbers of certain circulant graphs. Electron Notes Discr Math 17: 63\u201367","journal-title":"Electron Notes Discr Math"},{"key":"217_CR4","unstructured":"Bringmann B, Nijssen S (2007) What is frequent in a single graph? In: Proceedings of mining and learning with graphs (MLG), Florence, Italy"},{"issue":"4","key":"217_CR5","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1137\/S089548010241852X","volume":"17","author":"V Crespi","year":"2004","unstructured":"Crespi V (2004) Exact formulae for the lovasz theta function of sparse circulant graphs. SIAM J Discr Math 17(4): 670\u2013674","journal-title":"SIAM J Discr Math"},{"key":"217_CR6","first-page":"853","volume-title":"Proceedings of the 17th international joint conference on artificial intelligence","author":"L De Raedt","year":"2001","unstructured":"De Raedt L, Kramer S (2001) The levelwise version space algorithm and its application to molecular fragment finding. In: Nebel B (ed) Proceedings of the 17th international joint conference on artificial intelligence. Morgan Kaufmann, CA, pp 853\u2013862"},{"key":"217_CR7","volume-title":"Graph theory","author":"Reinhard Diestel","year":"2000","unstructured":"Diestel Reinhard (2000) Graph theory. Springer, New York"},{"key":"217_CR8","unstructured":"Fiedler M, Borgelt C (2007) Support computation for mining frequent subgraphs in a single graph. In: Proceedings of the fifth workshop on mining and learning with graphs (MLG\u201907), Florence"},{"key":"217_CR9","doi-asserted-by":"crossref","unstructured":"Furer M, Kasiviswanathan S Prasad (2008) Approximately Counting Embeddings into Random Graphs. In: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on approximation, randomization and combinatorial optimization: algorithms and techniques, Boston, MA, USA, pp 416\u2013429","DOI":"10.1007\/978-3-540-85363-3_33"},{"key":"217_CR10","volume-title":"Handbook of graph theory","author":"JL Gross","year":"2004","unstructured":"Gross JL, Yellen J (2004) Handbook of graph theory. CRC Press, Boston"},{"issue":"2","key":"217_CR11","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1093\/molbev\/msl180","volume":"24","author":"Grunewald","year":"2007","unstructured":"Grunewald et\u00a0al (2007) Qnet: An agglomerative method for the construction of phylogenetic networks from weighted quartets. Mole Biol Evol 24(2): 532\u2013538","journal-title":"Mole Biol Evol"},{"key":"217_CR12","doi-asserted-by":"crossref","unstructured":"He H, Singh AK (2007) Efficient algorithms for mining significant substructures in graphs with quality guarantees. In: IEEE international conference on data mining, Omaha, Nebraska, pp 163\u2013172","DOI":"10.1109\/ICDM.2007.11"},{"key":"217_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell P, Ne\u0161et\u0159il J (2004) Graphs and homomorphisms. Oxford University Press, Oxford"},{"issue":"11","key":"217_CR14","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"22;20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 22;20(11): 1746\u20131758","journal-title":"Bioinformatics"},{"key":"217_CR15","first-page":"48","volume":"1","author":"Donald E Knuth","year":"1994","unstructured":"Knuth Donald E (1994) The sandwich theorem. Electron J Combin 1: 48","journal-title":"Electron J Combin"},{"issue":"3","key":"217_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Discov 11(3): 243\u2013271","journal-title":"Data Min Knowl Discov"},{"key":"217_CR17","unstructured":"LaPaugh AS, Rivest RL (1978) The subgraph homeomorphism problem. In: STOC \u201978. ACM Press, New York, NY, USA, pp 40\u201350"},{"key":"217_CR18","unstructured":"Mcglohon M, Leskovec J, Faloutsos C, Hurst M, Glance N (2007) Finding patterns in blog shapes and blog evolution. In: Proceedings of the international conference on weblogs and social media, Boulder, CO, USA, pp 26\u201328"},{"key":"217_CR19","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19, 20","author":"S Muggleton","year":"1994","unstructured":"Muggleton S, De Raedt L (1994) Inductive logic programming : theory and methods. J Logic Prog 19, 20: 629\u2013679","journal-title":"J Logic Prog"},{"key":"217_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/S0024611503014412","volume":"3","author":"M Muzychuk","year":"2004","unstructured":"Muzychuk M (2004) A solution of the isomorphism problem for circulant graphs. Proc Lond Math Soc 3: 1\u201341","journal-title":"Proc Lond Math Soc"},{"key":"217_CR21","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Boston"},{"key":"217_CR22","unstructured":"Ramon J, Francis T, Blockeel H (2000) Learning a Tsume-Go heuristic with Tilde. In: Proceedings of CG2000, the second international conference on computers and games, Hamamatsu, Japan. Lecture Notes in Computer Science, vol 2063. Springer, NY, pp 151\u2013169"},{"key":"217_CR23","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T (2007) Fast best-effort pattern matching in large attributed graphs. In: KDD \u201907: proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, New York, NY, USA, pp 737\u2013746","DOI":"10.1145\/1281192.1281271"},{"issue":"2","key":"217_CR24","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-006-0044-8","volume":"13","author":"N Vanetik","year":"2006","unstructured":"Vanetik N, Shimony SE, Gudes E (2006) Support measures for graph data. Data Min Knowl Discov 13(2): 243\u2013260","journal-title":"Data Min Knowl Discov"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0217-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-011-0217-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0217-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T21:37:11Z","timestamp":1560029831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-011-0217-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,27]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["217"],"URL":"https:\/\/doi.org\/10.1007\/s10618-011-0217-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,27]]}}}