{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:27:37Z","timestamp":1772497657539,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T00:00:00Z","timestamp":1279929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s12293-010-0048-1","type":"journal-article","created":{"date-parts":[[2010,7,23]],"date-time":"2010-07-23T04:22:16Z","timestamp":1279858936000},"page":"183-199","source":"Crossref","is-referenced-by-count":32,"title":["Stratified prototype selection based on a steady-state memetic algorithm: a study of scalability"],"prefix":"10.1007","volume":"2","author":[{"given":"Joaqu\u00edn","family":"Derrac","sequence":"first","affiliation":[]},{"given":"Salvador","family":"Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Herrera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,24]]},"reference":[{"key":"48_CR1","volume-title":"Swarm intelligence in data mining. Studies in computational intelligence, vol 34","year":"2006","unstructured":"Abraham, A, Grosan, C, Ramos, V (eds) (2006) Swarm intelligence in data mining. Studies in computational intelligence, vol 34. Springer, New York"},{"key":"48_CR2","volume-title":"Introduction to machine learning","author":"E Alpaydin","year":"2004","unstructured":"Alpaydin E (2004) Introduction to machine learning. The MIT Press, New York"},{"issue":"11","key":"48_CR3","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1109\/TKDE.2007.190645","volume":"19","author":"F Angiulli","year":"2007","unstructured":"Angiulli F (2007) Fast nearest neighbor condensation for large data sets classification. IEEE Trans Knowl Data Eng 19(11): 1450\u20131464","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"48_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s12293-009-0010-2","volume":"1","author":"C Aranha","year":"2009","unstructured":"Aranha C, Iba H (2009) The memetic tree-based genetic algorithm and its application to portfolio optimization. Memetic Comp 1(2): 139\u2013151","journal-title":"Memetic Comp"},{"key":"48_CR5","unstructured":"Asuncion A, Newman DJ (2007) UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"1","key":"48_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s12293-008-0005-4","volume":"1","author":"J Bacardit","year":"2009","unstructured":"Bacardit J, Burke E, Krasnogor N (2009) Improving the scalability of rule-based evolutionary learning. Memetic Comp 1(1): 55\u201367","journal-title":"Memetic Comp"},{"key":"48_CR7","unstructured":"Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Tech Rep CMU-CS-94-163. Computer Science Department, Pittsburgh, PA"},{"issue":"12","key":"48_CR8","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1002\/int.1068","volume":"16","author":"J Bezdek","year":"2001","unstructured":"Bezdek J, Kuncheva L (2001) Nearest prototype classifier designs: an experimental study. Int J Intell Syst 16(12): 1445\u20131473","journal-title":"Int J Intell Syst"},{"key":"48_CR9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.datak.2006.01.008","volume":"60","author":"J Cano","year":"2007","unstructured":"Cano J, Lozano FHM (2007) Evolutionary stratified training set selection for extracting classification rules with trade-off precision-interpretability. Data Knowl Eng 60: 90\u2013100","journal-title":"Data Knowl Eng"},{"issue":"6","key":"48_CR10","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TEVC.2003.819265","volume":"7","author":"JR Cano","year":"2003","unstructured":"Cano JR, Herrera F, Lozano M (2003) Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study. IEEE Trans Evol Comput 7(6): 561\u2013575","journal-title":"IEEE Trans Evol Comput"},{"issue":"7","key":"48_CR11","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/j.patrec.2004.09.043","volume":"26","author":"JR Cano","year":"2005","unstructured":"Cano JR, Herrera F, Lozano M (2005) Stratification for scaling up evolutionary prototype selection. Pattern Recognit Lett 26(7): 953\u2013963","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"48_CR12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1177\/001316446002000104","volume":"20","author":"J Cohen","year":"1960","unstructured":"Cohen J (1960) A coefficient of agreement for nominal scales. Educ Psychol Meas 20(1): 37\u201346","journal-title":"Educ Psychol Meas"},{"issue":"1","key":"48_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1): 21\u201327","journal-title":"IEEE Trans Inf Theory"},{"issue":"11","key":"48_CR14","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1109\/TKDE.2008.227","volume":"21","author":"P Cunningham","year":"2008","unstructured":"Cunningham P (2008) A taxonomy of similarity mechanisms for case-based reasoning. IEEE Trans Knowl Data Eng 21(11): 1532\u20131543","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"48_CR15","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7: 1\u201330","journal-title":"J Mach Learn Res"},{"key":"48_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to evolutionary computing. Natural computing","author":"AE Eiben","year":"2003","unstructured":"Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Natural computing. Springer-Verlag, New York"},{"key":"48_CR17","first-page":"265","volume-title":"Foundations of genetic algorithms","author":"LJ Eshelman","year":"1991","unstructured":"Eshelman LJ (1991) The CHC adaptative search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Rawlins GJE (eds) Foundations of genetic algorithms. Morgan Kaufmann, San Mateo, pp 265\u2013283"},{"issue":"2","key":"48_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s12293-008-0006-3","volume":"1","author":"T Fischer","year":"2009","unstructured":"Fischer T, Bauer K, Merz P, Bauer K (2009) Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm. Memetic Comp 1(2): 101\u2013123","journal-title":"Memetic Comp"},{"issue":"2-3","key":"48_CR19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00993046","volume":"13","author":"S Forrest","year":"1993","unstructured":"Forrest S, Mitchell M (1993) What makes a problem hard for a genetic algorithm? some anomalous results and their explanation. Mach Learn 13(2-3): 285\u2013319","journal-title":"Mach Learn"},{"key":"48_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04923-5","volume-title":"Data mining and knowledge discovery with evolutionary algorithms","author":"AA Freitas","year":"2002","unstructured":"Freitas AA (2002) Data mining and knowledge discovery with evolutionary algorithms. Springer-Verlag, New York"},{"issue":"10","key":"48_CR21","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1007\/s00500-008-0392-y","volume":"13","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Herrera F (2009) A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput 13(10): 959\u2013977","journal-title":"Soft Comput"},{"issue":"8","key":"48_CR22","doi-asserted-by":"crossref","first-page":"2693","DOI":"10.1016\/j.patcog.2008.02.006","volume":"41","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Cano JR, Herrera F (2008) A memetic algorithm for evolutionary prototype selection: a scaling up approach. Pattern Recognit 41(8): 2693\u20132709","journal-title":"Pattern Recognit"},{"key":"48_CR23","volume-title":"Evolutionary computation in data mining","year":"2005","unstructured":"Ghosh, A, Jain, LC (eds) (2005) Evolutionary computation in data mining. Springer-Verlag, New York"},{"issue":"6","key":"48_CR24","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1142\/S0129065708001725","volume":"18","author":"R Gil-Pita","year":"2008","unstructured":"Gil-Pita R, Yao X (2008) Evolving edited k-nearest neighbor classifiers. Int J Neural Syst 18(6): 459\u2013467","journal-title":"Int J Neural Syst"},{"key":"48_CR25","volume-title":"Feature extraction: foundations and applications","year":"2006","unstructured":"Guyon, I, Gunn, S, Nikravesh, M, Zadeh, LA (eds) (2006) Feature extraction: foundations and applications. Springer, New York"},{"issue":"3","key":"48_CR26","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/s10618-008-0121-2","volume":"18","author":"A Haro-Garc\u00eda de","year":"2009","unstructured":"de Haro-Garc\u00eda A, Garc\u00eda-Pedrajas N (2009) A divide-and-conquer recursive approach for scaling up instance selection algorithms. Data Min Knowl Discov 18(3): 392\u2013418","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"48_CR27","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"PE Hart","year":"1968","unstructured":"Hart PE (1968) The condensed nearest neighbor rule. IEEE Trans Inf Theory 14(3): 515\u2013516","journal-title":"IEEE Trans Inf Theory"},{"key":"48_CR28","unstructured":"Hart WE (1994) Adaptive global optimization with local search. PhD thesis, University of California, San Diego"},{"key":"48_CR29","volume-title":"Recent advances in memetic algorithms","year":"2005","unstructured":"Hart, WE, Krasnogor, N, Smith, JE (eds) (2005) Recent advances in memetic algorithms. Springer-Verlag, New York"},{"issue":"1","key":"48_CR30","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s12293-008-0004-5","volume":"1","author":"SMK Hasan","year":"2009","unstructured":"Hasan SMK, Sarker R, Essam D, Cornforth D (2009) Memetic algorithms for solving job-shop scheduling problems. Memetic Comp 1(1): 69\u201383","journal-title":"Memetic Comp"},{"issue":"13","key":"48_CR31","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1016\/S0167-8655(02)00109-5","volume":"23","author":"SY Ho","year":"2002","unstructured":"Ho SY, Liu CC, Liu S (2002) Design of an optimal nearest neighbor classifier using an intelligent genetic algorithm. Pattern Recognit Lett 23(13): 1495\u20131503","journal-title":"Pattern Recognit Lett"},{"issue":"5","key":"48_CR32","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1016\/j.patcog.2008.09.027","volume":"42","author":"P Hore","year":"2009","unstructured":"Hore P, Hall LO, Goldgof DB (2009) A scalable framework for cluster ensembles. Pattern Recognit 42(5): 676\u2013688","journal-title":"Pattern Recognit"},{"key":"48_CR33","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Nakashima T (1998) Evolution of reference sets in nearest neighbor classification. In: Second Asia-Pacific conference on simulated evolution and learning on simulated evolution and learning (SEAL\u201998). Lecture notes in computer science, vol 1585, pp 82\u201389","DOI":"10.1007\/3-540-48873-1_12"},{"key":"48_CR34","unstructured":"Jankowski N, Grochowski M (2004) Comparison of instances selection algorithms I. Algorithms survey. In: Rutkowski L (ed) International conference on artificial intelligence and soft computing (IAISC\u201904). LNAI, vol 3070, pp 598\u2013603"},{"issue":"3","key":"48_CR35","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/s10044-003-0191-0","volume":"6","author":"SW Kim","year":"2003","unstructured":"Kim SW, Oommen BJ (2003) On using prototype reduction schemes to optimize dissimilarity-based classification. Pattern Anal Appl 6(3): 232\u2013244","journal-title":"Pattern Anal Appl"},{"issue":"5","key":"48_CR36","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans Evol Comput 9(5): 474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"key":"48_CR37","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/0167-8655(95)00047-K","volume":"16","author":"LI Kuncheva","year":"1995","unstructured":"Kuncheva LI (1995) Editing for the k-nearest neighbors rule by a genetic algorithm. Pattern Recognit Lett 16: 809\u2013814","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"48_CR38","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/5326.661099","volume":"28","author":"LI Kuncheva","year":"1998","unstructured":"Kuncheva LI, Bezdek JC (1998) Nearest prototype classification: clustering, genetic algorithms, or random search?. IEEE Trans Syst Man Cybernet C 28(1): 160\u2013164","journal-title":"IEEE Trans Syst Man Cybernet C"},{"issue":"3","key":"48_CR39","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1007608224229","volume":"40","author":"TS Lim","year":"2000","unstructured":"Lim TS, Loh WY, Shih YS (2000) A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Mach Learn 40(3): 203\u2013228","journal-title":"Mach Learn"},{"key":"48_CR40","volume-title":"Instance selection and construction for data mining. The Springer international series in engineering and computer science","year":"2001","unstructured":"Liu, H, Motoda, H (eds) (2001) Instance selection and construction for data mining. The Springer international series in engineering and computer science. Springer, New York"},{"issue":"2","key":"48_CR41","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1014056429969","volume":"6","author":"H Liu","year":"2002","unstructured":"Liu H, Motoda H (2002) On issues of instance selection. Data Min Knowl Discov 6(2): 115\u2013130","journal-title":"Data Min Knowl Discov"},{"key":"48_CR42","volume-title":"Computational methods of feature selection. CRC Data mining and knowledge discovery series","year":"2007","unstructured":"Liu, H, Motoda, H (eds) (2007) Computational methods of feature selection. CRC Data mining and knowledge discovery series. Chapman & Hall, London"},{"issue":"4","key":"48_CR43","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1016304305535","volume":"6","author":"H Liu","year":"2002","unstructured":"Liu H, Hussain F, Tan CL, Dash M (2002) Discretization: an enabling technique. Data Min Knowl Discov 6(4): 393\u2013423","journal-title":"Data Min Knowl Discov"},{"issue":"9","key":"48_CR44","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1109\/TNN.2008.2000838","volume":"19","author":"Z Liu","year":"2008","unstructured":"Liu Z, Elhanany I (2008) A fast and scalable recurrent neural network based on stochastic meta descent. IEEE Trans Neural Netw 19(9): 1652\u20131658","journal-title":"IEEE Trans Neural Netw"},{"issue":"3","key":"48_CR45","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1162\/1063656041774983","volume":"12","author":"M Lozano","year":"2004","unstructured":"Lozano M, Herrera F, Krasnogor N, Molina D (2004) Real-coded memetic algorithms with crossover hill-climbing. Evol Comput 12(3): 273\u2013302","journal-title":"Evol Comput"},{"issue":"10","key":"48_CR46","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1016\/j.patcog.2006.04.005","volume":"39","author":"M Lozano","year":"2006","unstructured":"Lozano M, Sotoca JM, S\u00e1nchez JS, Pla F, Pekalska E, Duin RPW (2006) Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces. Pattern Recognit 39(10): 1827\u20131838","journal-title":"Pattern Recognit"},{"key":"48_CR47","first-page":"997","volume":"9","author":"E Marchiori","year":"2008","unstructured":"Marchiori E (2008) Hit miss networks with applications to instance selection. J Mach Learn Res 9: 997\u20131017","journal-title":"J Mach Learn Res"},{"key":"48_CR48","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Tech Rep C3P 826, California Institute of Technology, Pasadena"},{"key":"48_CR49","doi-asserted-by":"crossref","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2009) A new fast prototype selection method based on clustering. Pattern Anal Appl (in press). doi: 10.1007\/s10044-008-0142-x","DOI":"10.1007\/s10044-008-0142-x"},{"issue":"1","key":"48_CR50","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TSMCB.2006.883274","volume":"37","author":"YS Ong","year":"2007","unstructured":"Ong YS, Krasnogor N, Ishibuchi H (2007) Special issue on memetic algorithms. IEEE Trans Syst Man Cybernet B 37(1): 2\u20135","journal-title":"IEEE Trans Syst Man Cybernet B"},{"key":"48_CR51","volume-title":"Nearest neighbor search: a database perspective","author":"AN Papadopoulos","year":"2004","unstructured":"Papadopoulos AN, Manolopoulos Y (2004) Nearest neighbor search: a database perspective. Springer-Verlag Telos, Santa Clara"},{"issue":"2","key":"48_CR52","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1009876119989","volume":"3","author":"FJ Provost","year":"1999","unstructured":"Provost FJ, Kolluri V (1999) A survey of methods for scaling up inductive algorithms. Data Min Knowl Discov 3(2): 131\u2013169","journal-title":"Data Min Knowl Discov"},{"key":"48_CR53","volume-title":"Data preparation for data mining. The Morgan Kaufmann series in data management systems","author":"D Pyle","year":"1999","unstructured":"Pyle D (1999) Data preparation for data mining. The Morgan Kaufmann series in data management systems. Morgan Kaufmann, San Fransisco"},{"issue":"6","key":"48_CR54","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","volume":"21","author":"G Ritter","year":"1975","unstructured":"Ritter G, Woodruff H, Lowry S, Isenhour T (1975) An algorithm for a selective nearest neighbor decision rule. IEEE Trans Inf Theory 21(6): 665\u2013669","journal-title":"IEEE Trans Inf Theory"},{"key":"48_CR55","volume-title":"Nearest-neighbor methods in learning and vision: theory and practice","year":"2006","unstructured":"Shakhnarovich, G, Darrell, T, Indyk, P (eds) (2006) Nearest-neighbor methods in learning and vision: theory and practice. The MIT Press, New York"},{"key":"48_CR56","volume-title":"Handbook of parametric and nonparametric statistical procedures","author":"DJ Sheskin","year":"2007","unstructured":"Sheskin DJ (2007) Handbook of parametric and nonparametric statistical procedures, 4th edn. Chapman & Hall\/CRC, London","edition":"4"},{"key":"48_CR57","unstructured":"Sierra B, Lazkano E, Inza I, Merino M, Larra\u00f1aga P, Quiroga J (2001) Prototype selection and feature subset selection by estimation of distribution algorithms. A case study in the survival of cirrhotic patients treated with tips. In: Proceedings of the 8th conference on AI in medicine in Europe (AIME\u201901). Springer-Verlag, London, pp 20\u201329"},{"issue":"6","key":"48_CR58","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1(6): 80\u201383","journal-title":"Biom Bull"},{"issue":"3","key":"48_CR59","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"DL Wilson","year":"1972","unstructured":"Wilson DL (1972) Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans Syst Man Cybernet 2(3): 408\u2013421","journal-title":"IEEE Trans Syst Man Cybernet"},{"issue":"3","key":"48_CR60","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"DR Wilson","year":"2000","unstructured":"Wilson DR, Martinez TR (2000) Reduction techniques for instance-based learning algorithms. Mach Learn 38(3): 257\u2013286","journal-title":"Mach Learn"},{"key":"48_CR61","volume-title":"Data mining: practical machine learning tools and techniques. Morgan Kaufmann series in data management systems","author":"IH Witten","year":"2005","unstructured":"Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques. Morgan Kaufmann series in data management systems, 2nd edn. Morgan Kaufmann, San Fransisco","edition":"2"},{"key":"48_CR62","volume-title":"Biostatistical analysis","author":"JH Zar","year":"2009","unstructured":"Zar JH (2009) Biostatistical analysis, 5th edn. Prentice Hall, Upper Saddle","edition":"5"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-010-0048-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-010-0048-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-010-0048-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T07:45:53Z","timestamp":1559461553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-010-0048-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,24]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s12293-010-0048-1","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,24]]}}}