乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T02:11:52Z","timestamp":1673057512676},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,22]],"date-time":"2015-08-22T00:00:00Z","timestamp":1440201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10115-015-0874-z","type":"journal-article","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T11:51:59Z","timestamp":1440157919000},"page":"229-252","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks"],"prefix":"10.1007","volume":"48","author":[{"given":"Parisutham","family":"Nirmala","sequence":"first","affiliation":[]},{"given":"Ramasubramony Sulochana","family":"Lekshmi","sequence":"additional","affiliation":[]},{"given":"Rethnasamy","family":"Nadarajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,22]]},"reference":[{"key":"874_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and mining graph data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal CC, Wang H (2010) Managing and mining graph data, vol 40. Springer, Berlin"},{"issue":"4","key":"874_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1504\/IJBRA.2013.054688","volume":"9","author":"RJV Berlo","year":"2013","unstructured":"Berlo RJV, Winterbach W, Groot MJD, Bender A, Verheijen PJ, Reinders MJ, Ridder DD (2013) Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels. International J Bioinform Res Appl 9(4):407\u2013432","journal-title":"International J Bioinform Res Appl"},{"key":"874_CR3","doi-asserted-by":"crossref","unstructured":"Bunke H, Foggia P, Guidobaldi C, Sansone C, Vento M (2002) A comparison of algorithms for maximum common subgraph on randomly connected graphs. In: Caelli T, Amin A, Duin RPW, de Ridder D, Kamel M (eds) Structural, syntactic, and statistical pattern recognition. Springer, Berlin, pp 123\u2013132","DOI":"10.1007\/3-540-70659-3_12"},{"issue":"13","key":"874_CR4","doi-asserted-by":"crossref","first-page":"i366","DOI":"10.1093\/bioinformatics\/btn186","volume":"24","author":"Y Cao","year":"2008","unstructured":"Cao Y, Jiang T, Girke T (2008) A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics 24(13):i366\u2013i374","journal-title":"Bioinformatics"},{"issue":"6","key":"874_CR5","doi-asserted-by":"crossref","first-page":"066,111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066,111","journal-title":"Phys Rev E"},{"issue":"1","key":"874_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.7155\/jgaa.00139","volume":"11","author":"D Conte","year":"2007","unstructured":"Conte D, Foggia P, Vento M (2007) Challenging complexity of maximum common subgraph detection algorithms: a performance analysis of three algorithms on a wide database of graphs. J Graph Algorithms Appl 11(1):99\u2013143","journal-title":"J Graph Algorithms Appl"},{"key":"874_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/0470073047","volume-title":"Mining graph data","author":"DJ Cook","year":"2006","unstructured":"Cook DJ, Holder LB (2006) Mining graph data. Wiley, London"},{"issue":"3","key":"874_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10044-004-0222-5","volume":"7","author":"PJ Dickinson","year":"2004","unstructured":"Dickinson PJ, Bunke H, Dadej A, Kraetzl M (2004) Matching graphs with unique node labels. Pattern Anal Appl 7(3):243\u2013254","journal-title":"Pattern Anal Appl"},{"issue":"10","key":"874_CR9","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.3844\/ajassp.2005.1395.1400","volume":"2","author":"IM Emary El","year":"2005","unstructured":"El Emary IM, Al Rabia AI (2005) Estimation techniques for monitoring and controlling the performance of the computer communication networks. Am J Appl Sci 2(10):1395","journal-title":"Am J Appl Sci"},{"issue":"4","key":"874_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TDSC.2006.50","volume":"3","author":"AY Fu","year":"2006","unstructured":"Fu AY, Wenyin L, Deng X (2006) Detecting phishing web pages with visual similarity assessment based on earth mover\u2019s distance (EMD). IEEE Trans Dependable Secure Comput 3(4):301\u2013311","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"874_CR11","volume-title":"Handbook of graph theory","author":"JL Gross","year":"2004","unstructured":"Gross JL, Yellen J (2004) Handbook of graph theory. CRC Press, Boca Raton"},{"issue":"1","key":"874_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Disc 15(1):55\u201386","journal-title":"Data Min Knowl Disc"},{"key":"874_CR13","volume-title":"Principles of data mining","author":"DJ Hand","year":"2001","unstructured":"Hand DJ, Mannila H, Smyth P (2001) Principles of data mining. MIT Press, Cambridge"},{"issue":"1","key":"874_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch I (2001) Enumerating all connected maximal common subgraphs in two graphs. Theor Comput Sci 250(1):1\u201330","journal-title":"Theor Comput Sci"},{"issue":"4","key":"874_CR15","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G Levi","year":"1973","unstructured":"Levi G (1973) A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9(4):341\u2013352","journal-title":"Calcolo"},{"issue":"03","key":"874_CR16","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1142\/S0218001404003204","volume":"18","author":"J Llados","year":"2004","unstructured":"Llados J, Sanchez G (2004) Graph matching versus graph parsing in graphics recognitiona combined approach. Int J Pattern Recognit Artif Intell 18(03):455\u2013473","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"1","key":"874_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor JJ (1982) Backtrack search algorithms and the maximal common subgraph problem. Softw Practice Exp 12(1):23\u201334","journal-title":"Softw Practice Exp"},{"issue":"3","key":"874_CR18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1021\/ci00031a005","volume":"21","author":"JJ McGregor","year":"1981","unstructured":"McGregor JJ, Willett P (1981) Use of a maximum common subgraph algorithm in the automatic identification of ostensible bond changes occurring in chemical reactions. J Chem Inf Comput Sci 21(3):137\u2013140","journal-title":"J Chem Inf Comput Sci"},{"key":"874_CR19","doi-asserted-by":"crossref","unstructured":"Palmer CR, Gibbons PB, Faloutsos C (2002) Anf: a fast and scalable tool for data mining in massive graphs. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 81\u201390","DOI":"10.1145\/775047.775059"},{"issue":"2","key":"874_CR20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1021\/ci010381f","volume":"42","author":"JW Raymond","year":"2002","unstructured":"Raymond JW, Gardiner EJ, Willett P (2002) Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. J Chem Inf Comput Sci 42(2):305\u2013316","journal-title":"J Chem Inf Comput Sci"},{"issue":"7","key":"874_CR21","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"JW Raymond","year":"2002","unstructured":"Raymond JW, Willett P (2002) Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J Comput-Aided Mol Des 16(7):521\u2013533","journal-title":"J Comput-Aided Mol Des"},{"key":"874_CR22","doi-asserted-by":"crossref","unstructured":"Rutgers JH, Wolkotte PT, Holzenspies PK, Kuper J, Smit GJ (2010) An approximate maximum common subgraph algorithm for large digital circuits. In: 2010 13th Euromicro conference on digital system design: architectures, methods and tools (DSD). IEEE, pp 699\u2013705","DOI":"10.1109\/DSD.2010.29"},{"issue":"S11","key":"874_CR23","first-page":"72","volume":"6","author":"R Vijayalakshmi","year":"2011","unstructured":"Vijayalakshmi R, Nadarajan R, Nirmala P, Thilaga M (2011) Performance monitoring of large communication networks using maximum common subgraphs. Int J Artif Intell 6(S11):72\u201386","journal-title":"Int J Artif Intell"},{"issue":"A11","key":"874_CR24","first-page":"92","volume":"7","author":"R Vijayalakshmi","year":"2011","unstructured":"Vijayalakshmi R, Nadarajan R, Nirmala P, Thilaga M (2011) A divisive clustering algorithm for performance monitoring of large networks using maximum common subgraphs. Int J Artif Intell 7(A11):92\u2013109","journal-title":"Int J Artif Intell"},{"key":"874_CR25","doi-asserted-by":"crossref","unstructured":"Wang Y, Maple C (2005) A novel efficient algorithm for determining maximum common subgraphs. In: Ninth international conference on information visualisation, 2005. Proceedings. IEEE, pp 657\u2013663","DOI":"10.1109\/IV.2005.11"},{"issue":"4","key":"874_CR26","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1145\/1189769.1189777","volume":"31","author":"X Yan","year":"2006","unstructured":"Yan X, Zhu F, Yu PS, Han J (2006) Feature-based similarity search in graph structures. ACM Trans Database Syst (TODS) 31(4):1418\u20131453","journal-title":"ACM Trans Database Syst (TODS)"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0874-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0874-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0874-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:11:18Z","timestamp":1559124678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0874-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,22]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["874"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0874-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,22]]}}}