{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:50Z","timestamp":1763468210863},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T00:00:00Z","timestamp":1404950400000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10618-014-0367-9","type":"journal-article","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T05:52:01Z","timestamp":1404885121000},"page":"1554-1585","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Classy: fast clustering streams of call-graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Orestis","family":"Kostakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"367_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2003) A framework for clustering evolving data streams. In: Proceedings of the 29th international conference on very large data bases-volume 29, VLDB Endowment, pp 81\u201392","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"367_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2004) A framework for projected clustering of high dimensional data streams. In: Proceedings of the thirtieth international conference on very large data bases-volume 30, VLDB Endowment, pp 852\u2013863","DOI":"10.1016\/B978-012088469-8.50075-9"},{"key":"367_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Zhao Y, Yu P (2010) On clustering graph streams. In: Proceedings of the SIAM international conference on data mining, pp 478\u2013489","DOI":"10.1137\/1.9781611972801.42"},{"issue":"9","key":"367_CR4","first-page":"1488","volume":"76","author":"T Akutsu","year":"1993","unstructured":"Akutsu T (1993) A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans Fundam Electron Commun Comput Sci 76(9):1488\u20131493","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"367_CR5","unstructured":"Bayer U, Comparetti PM, Hlauschek C, Kruegel C, Kirda E (2009) Scalable, behavior-based malware clustering. In: 16th Network & distributed system security conference, vol 9, pp 8\u201311"},{"key":"367_CR6","doi-asserted-by":"crossref","unstructured":"Bourquin M, King A, Robbins E (2013) Binslayer: accurate comparison of binary executables. In: Proceedings of the 2nd ACM SIGPLAN program protection and reverse engineering workshop, ACM, p 4","DOI":"10.1145\/2430553.2430557"},{"key":"367_CR7","unstructured":"Briones I, Gomez A (2008) Graphs, entropy and grid computing: automatic comparison of malware. Proceedings of the virus bulletin conference, pp 1\u201312"},{"issue":"8","key":"367_CR8","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1997","unstructured":"Bunke H (1997) On a relation between graph edit distance and maximum common subgraph. Pattern Recognit Lett 18(8):689\u2013694","journal-title":"Pattern Recognit Lett"},{"issue":"4","key":"367_CR9","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W Burkhard","year":"1973","unstructured":"Burkhard W, Keller R (1973) Some approaches to best-match file searching. Commun ACM 16(4):230\u2013236","journal-title":"Commun ACM"},{"key":"367_CR10","doi-asserted-by":"crossref","unstructured":"Cao F, Ester M, Qian W, Zhou A (2006) Density-based clustering over an evolving data stream with noise. In: Proceedings of the SIAM international conference on data mining, pp 328\u2013339","DOI":"10.1137\/1.9781611972764.29"},{"key":"367_CR11","unstructured":"Carrera E, Erd\u00e9lyi G (2004) Digital genome mapping-advanced binary malware analysis. In: Proceedings of the virus bulletin conference, pp 187\u2013197"},{"key":"367_CR12","doi-asserted-by":"crossref","unstructured":"Charikar M, O\u2019Callaghan L, Panigrahy R (2003) Better streaming algorithms for clustering problems. In: Proceedings of the ACM symposium on theory of computing, ACM, pp 30\u201339","DOI":"10.1145\/780542.780548"},{"issue":"1","key":"367_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1508857.1508859","volume":"34","author":"J Cheng","year":"2009","unstructured":"Cheng J, Ke Y, Ng W (2009) Efficient query processing on graph databases. ACM Trans Database Syst (TODS) 34(1):2","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"4","key":"367_CR14","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1013886.1007518","volume":"29","author":"M Christodorescu","year":"2004","unstructured":"Christodorescu M, Jha S (2004) Testing malware detectors. ACM SIGSOFT Softw Eng Notes 29(4):34\u201344","journal-title":"ACM SIGSOFT Softw Eng Notes"},{"issue":"03","key":"367_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. Int J Pattern Recognit Artif Intell 18(03):265\u2013298","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"367_CR16","doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the twentieth annual symposium on computational geometry, ACM, pp 253\u2013262","DOI":"10.1145\/997817.997857"},{"key":"367_CR17","unstructured":"Dean T, Boddy M (1988) An analysis of time-dependent planning. In: Proceedings of the 17th national conference on artificial intelligence, pp 49\u201354"},{"key":"367_CR18","first-page":"1","volume":"5","author":"T Dullien","year":"2005","unstructured":"Dullien T, Rolles R (2005) Graph-based comparison of executable objects. SSTIC 5:1\u20133","journal-title":"SSTIC"},{"issue":"5","key":"367_CR19","first-page":"29","volume":"7","author":"AAE Elhadi","year":"2013","unstructured":"Elhadi AAE, Maarof MA, Barry BI (2013) Improving the detection of malware behaviour using simplified data dependent api call graph. Int J Secur Appl 7(5):29\u201342","journal-title":"Int J Secur Appl"},{"key":"367_CR20","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96:226\u2013231","journal-title":"KDD"},{"key":"367_CR21","unstructured":"Flake H (2004) Structural comparison of executable objects. In: Proceedings of the international GI workshop on detection of intrusions and malware & vulnerability assessment, pp 161\u2013174"},{"issue":"6","key":"367_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R Floyd","year":"1962","unstructured":"Floyd R (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"key":"367_CR23","doi-asserted-by":"crossref","unstructured":"Gascon H, Yamaguchi F, Arp D, Rieck K (2013) Structural detection of android malware using embedded call graphs. In: Proceedings of the 2013 ACM workshop on artificial intelligence and security, ACM, pp 45\u201354","DOI":"10.1145\/2517312.2517315"},{"key":"367_CR24","first-page":"518","volume":"99","author":"A Gionis","year":"1999","unstructured":"Gionis A, Indyk P, Motwani R et al (1999) Similarity search in high dimensions via hashing. VLDB 99:518\u2013529","journal-title":"VLDB"},{"key":"367_CR25","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H, Tsaparas P (2005) Clustering aggregation. In: Proceedings of the 21st international conference on data engineering (ICDE), IEEE, pp 341\u2013352","DOI":"10.1109\/ICDE.2005.34"},{"key":"367_CR26","doi-asserted-by":"crossref","unstructured":"Giugno R, Shasha D (2002) Graphgrep: a fast and universal method for querying graphs. In: Proceedings of the 16th international conference on pattern recognition, IEEE, vol 2, pp 112\u2013115","DOI":"10.1109\/ICPR.2002.1048250"},{"issue":"3","key":"367_CR27","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TKDE.2003.1198387","volume":"15","author":"S Guha","year":"2003","unstructured":"Guha S, Meyerson A, Mishra N, Motwani R, O\u2019Callaghan L (2003) Clustering data streams: theory and practice. IEEE Trans Knowl Data Eng 15(3):515\u2013528","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"367_CR28","unstructured":"He H, Singh A (2006) Closure-tree: an index structure for graph queries. In: Proceedings of the 22nd international conference on data engineering, IEEE, pp 38\u201338"},{"key":"367_CR29","doi-asserted-by":"crossref","unstructured":"Hegedus J, Miche Y, Ilin A, Lendasse A (2011) Methodology for behavioral-based malware analysis and detection using random projections and k-nearest neighbors classifiers. In: Seventh international conference on computational intelligence and security (CIS), IEEE, pp 1016\u20131023","DOI":"10.1109\/CIS.2011.227"},{"key":"367_CR30","unstructured":"Hex-Rays (2008) Ida pro. http:\/\/www.hex-rays.com\/"},{"key":"367_CR31","doi-asserted-by":"crossref","unstructured":"Hu X, Chiueh T, Shin K (2009) Large-scale malware indexing using function-call graphs. In: Proceedings of the 16th ACM conference on computer and communications security, ACM, pp 611\u2013620","DOI":"10.1145\/1653662.1653736"},{"issue":"1","key":"367_CR32","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193\u2013218","journal-title":"J Classif"},{"key":"367_CR33","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on theory of computing, ACM, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"367_CR34","doi-asserted-by":"crossref","unstructured":"Jiang H, Wang H, Yu P, Zhou S (2007) Gstring: a novel approach for efficient search in graph databases. In: Proceedings of the IEEE 23rd international conference on data engineering, IEEE, pp 566\u2013575","DOI":"10.1109\/ICDE.2007.367902"},{"key":"367_CR35","doi-asserted-by":"crossref","unstructured":"Kang MG, Poosankam P, Yin H (2007) Renovo: a hidden code extractor for packed executables. In: Proceedings of the 2007 ACM workshop on recurring malcode, ACM, pp 46\u201353","DOI":"10.1145\/1314389.1314399"},{"issue":"4","key":"367_CR36","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s11416-011-0151-y","volume":"7","author":"J Kinable","year":"2011","unstructured":"Kinable J, Kostakis O (2011) Malware classification based on call graph clustering. J Comput Virol 7(4):233\u2013245","journal-title":"J Comput Virol"},{"key":"367_CR37","unstructured":"Kolbitsch C, Comparetti PM, Kruegel C, Kirda E, Zhou Xy, Wang X (2009) Effective and efficient malware detection at the end host. In: USENIX security symposium, pp 351\u2013366"},{"issue":"2","key":"367_CR38","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TKDE.2011.243","volume":"25","author":"G Kollios","year":"2013","unstructured":"Kollios G, Potamias M, Terzi E (2013) Clustering large probabilistic graphs. IEEE Trans Knowl Data Eng 25(2):325\u2013336","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"367_CR39","doi-asserted-by":"crossref","unstructured":"Kostakis O, Kinable J, Mahmoudi H, Mustonen K (2011) Improved call graph comparison using simulated annealing. In: Proceedings of the 2011 ACM symposium on applied computing, ACM, pp 1516\u20131523","DOI":"10.1145\/1982185.1982509"},{"key":"367_CR40","unstructured":"Kriege N, Mutzel P (2012) Subgraph matching kernels for attributed graphs. arXiv preprint arXiv:1206.6483"},{"issue":"1","key":"367_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10994-008-5084-4","volume":"74","author":"B Kulis","year":"2009","unstructured":"Kulis B, Basu S, Dhillon I, Mooney R (2009) Semi-supervised graph clustering: a kernel approach. Mach Learn 74(1):1\u201322","journal-title":"Mach Learn"},{"issue":"11","key":"367_CR42","doi-asserted-by":"crossref","first-page":"2701","DOI":"10.1109\/78.650096","volume":"45","author":"IJ Lin","year":"1997","unstructured":"Lin IJ, Kung SY (1997) Coding and comparison of dag\u2019s as a novel neural structure with applications to on-line handwriting recognition. IEEE Trans Signal Process 45(11):2701\u20132708","journal-title":"IEEE Trans Signal Process"},{"key":"367_CR43","doi-asserted-by":"crossref","unstructured":"Martignoni L, Christodorescu M, Jha S (2007) Omniunpack: fast, generic, and safe unpacking of malware. In: Twenty-third annual computer security applications conference (ACSAC) 2007, IEEE, pp 431\u2013441","DOI":"10.1109\/ACSAC.2007.15"},{"key":"367_CR44","doi-asserted-by":"crossref","unstructured":"Mishra N, Schreiber R, Stanton I, Tarjan RE (2007) Clustering social networks. In: Algorithms and models for the web-graph. Springer, Berlin, pp 56\u201367","DOI":"10.1007\/978-3-540-77004-6_5"},{"key":"367_CR45","doi-asserted-by":"crossref","unstructured":"Moser A, Kruegel C, Kirda E (2007a) Exploring multiple execution paths for malware analysis. In: IEEE symposium on security and privacy, IEEE, pp 231\u2013245","DOI":"10.1109\/SP.2007.17"},{"key":"367_CR46","doi-asserted-by":"crossref","unstructured":"Moser A, Kruegel C, Kirda E, (2007b) Limits of static analysis for malware detection. In: Computer security applications conference, 2007. ACSAC 2007. Twenty-third annual, IEEE, pp 421\u2013430","DOI":"10.1109\/ACSAC.2007.21"},{"issue":"1","key":"367_CR47","doi-asserted-by":"crossref","first-page":"205","DOI":"10.14778\/1687627.1687651","volume":"2","author":"P Papapetrou","year":"2009","unstructured":"Papapetrou P, Athitsos V, Kollios G, Gunopulos D (2009) Reference-based alignment in large sequence databases. Proc VLDB Endow 2(1):205\u2013216","journal-title":"Proc VLDB Endow"},{"key":"367_CR48","unstructured":"Ramon J, G\u00e4rtner T (2003) Expressivity versus efficiency of graph kernels. First international workshop on mining graphs, trees and sequences, pp 65\u201374"},{"key":"367_CR49","doi-asserted-by":"crossref","unstructured":"Rieck K, Holz T, Willems C, D\u00fcssel P, Laskov P (2008) Learning and classification of malware behavior. In: Detection of intrusions and malware, and vulnerability assessment. Springer, Berlin, pp 108\u2013125","DOI":"10.1007\/978-3-540-70542-0_6"},{"issue":"7","key":"367_CR50","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H (2009) Approximate graph edit distance computation by means of bipartite graph matching. Image Vis Comput 27(7):950\u2013959","journal-title":"Image Vis Comput"},{"key":"367_CR51","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/TSE.1979.234183","volume":"3","author":"BG Ryder","year":"1979","unstructured":"Ryder BG (1979) Constructing the call graph of a program. IEEE Trans Softw Eng 3:216\u2013226","journal-title":"IEEE Trans Softw Eng"},{"issue":"1","key":"367_CR52","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S Schaeffer","year":"2007","unstructured":"Schaeffer S (2007) Graph clustering. Comput Sci Rev 1(1):27\u201364","journal-title":"Comput Sci Rev"},{"issue":"4","key":"367_CR53","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10472-013-9335-0","volume":"69","author":"L Schietgat","year":"2013","unstructured":"Schietgat L, Ramon J, Bruynooghe M (2013) A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics. Ann Math Artif Intell 69(4):343\u2013376","journal-title":"Ann Math Artif Intell"},{"key":"367_CR54","unstructured":"Seward HH (1954) Information sorting in the application of electronic digital computers to business operations. PhD thesis, Department of Electrical Engineering, Massachusetts Institute of Technology"},{"key":"367_CR55","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze N, Schweitzer P, Van Leeuwen EJ, Mehlhorn K, Borgwardt KM (2011) Weisfeiler\u2013Lehman graph kernels. J Mach Learn Res 12:2539\u20132561","journal-title":"J Mach Learn Res"},{"key":"367_CR56","unstructured":"Snaker, Qwerton, Jibz (2006) Peid. http:\/\/www.aldeid.com\/wiki\/PEiD"},{"issue":"2","key":"367_CR57","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R Tarjan","year":"1984","unstructured":"Tarjan R, Van Leeuwen J (1984) Worst-case analysis of set union algorithms. J ACM 31(2):245\u2013281","journal-title":"J ACM"},{"key":"367_CR58","doi-asserted-by":"crossref","unstructured":"Tian Y, Patel J (2008) Tale: A tool for approximate large graph matching. In: Proceedings of the IEEE 24th international conference on data engineering, IEEE, pp 963\u2013972","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"367_CR59","unstructured":"Veeramani R, Rai N (2012) Windows api based malware detection and framework analysis. In: International conference on networks and cyber security, p 25"},{"key":"367_CR60","unstructured":"Venkateswaran J, Lachwani D, Kahveci T, Jermaine C (2006) Reference-based indexing of sequence databases. In: Proceedings of the 32nd international conference on very large data bases, VLDB Endowment, pp 906\u2013917"},{"key":"367_CR61","first-page":"1201","volume":"11","author":"S Vishwanathan","year":"2010","unstructured":"Vishwanathan S, Schraudolph NN, Kondor R, Borgwardt KM (2010) Graph kernels. J Mach Learn Res 11:1201\u20131242","journal-title":"J Mach Learn Res"},{"issue":"1","key":"367_CR62","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall S (1962) A theorem on Boolean matrices. J ACM 9(1):11\u201312","journal-title":"J ACM"},{"key":"367_CR63","doi-asserted-by":"crossref","unstructured":"Willems C, Holz T, Freiling F (2007) Toward automated dynamic malware analysis using cwsandbox. Proceedings of the 28th IEEE symposium on security and privacy, vol 5(2), pp 32\u201339","DOI":"10.1109\/MSP.2007.45"},{"key":"367_CR64","doi-asserted-by":"crossref","unstructured":"Williams D, Huan J, Wang W (2007) Graph database indexing using structured graph decomposition. In: Proceedings of the IEEE 23rd international conference on data engineering, IEEE, pp 976\u2013985","DOI":"10.1109\/ICDE.2007.368956"},{"key":"367_CR65","unstructured":"Xu JY, Sung AH, Chavez P, Mukkamala S (2004) Polymorphic malicious executable scanner by api sequence analysis. In: Fourth international conference on hybrid intelligent systems, HIS\u201904., IEEE, pp 378\u2013383"},{"issue":"1","key":"367_CR66","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11416-012-0175-y","volume":"9","author":"M Xu","year":"2013","unstructured":"Xu M, Wu L, Qi S, Xu J, Zhang H, Ren Y, Zheng N (2013) A similarity metric method of obfuscated malware using function-call graph. J Comput Virol Hacking Tech 9(1):35\u201347","journal-title":"J Comput Virol Hacking Tech"},{"key":"367_CR67","doi-asserted-by":"crossref","unstructured":"Yan X, Yu P, Han J (2005) Substructure similarity search in graph databases. In: Proceedings of the 2005 ACM SIGMOD international conference on management of data, ACM, pp 766\u2013777","DOI":"10.1145\/1066157.1066244"},{"issue":"1","key":"367_CR68","doi-asserted-by":"crossref","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng Z, Tung A, Wang J, Feng J, Zhou L (2009) Comparing stars: on approximating graph edit distance. Proc VLDB Endow 2(1):25\u201336","journal-title":"Proc VLDB Endow"},{"key":"367_CR69","unstructured":"Zhao P, Yu J, Yu P (2007) Graph indexing: tree+ delta $$\\le $$ \u2264 graph. In: Proceedings of the 33rd international conference on very large data bases, VLDB Endowment, pp 938\u2013949"},{"issue":"1","key":"367_CR70","doi-asserted-by":"crossref","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural\/attribute similarities. Proc VLDB Endow 2(1):718\u2013729","journal-title":"Proc VLDB Endow"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0367-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-014-0367-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0367-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T15:37:41Z","timestamp":1565624261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-014-0367-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,10]]},"references-count":70,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["367"],"URL":"https:\/\/doi.org\/10.1007\/s10618-014-0367-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,10]]}}}