{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T04:59:23Z","timestamp":1781931563836,"version":"3.54.5"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T00:00:00Z","timestamp":1443139200000},"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":["Soft Comput"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00500-015-1878-z","type":"journal-article","created":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T07:36:57Z","timestamp":1443166617000},"page":"1735-1752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Analysing and characterising optimization problems using length scale"],"prefix":"10.1007","volume":"21","author":[{"given":"Rachael","family":"Morgan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcus","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,25]]},"reference":[{"key":"1878_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Hinneburg A, Keim DA (2001) On the surprising behavior of distance metrics in high dimensional spaces. In: Proceedings of the 8th international conference on database theory. Springer, London, pp 420\u2013434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"1878_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02538-9","volume-title":"Experimental methods for the analysis of optimization algorithms","author":"T Bartz-Beielstein","year":"2010","unstructured":"Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M (2010) Experimental methods for the analysis of optimization algorithms. Springer, New York"},{"issue":"1","key":"1878_CR3","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.cam.2005.08.011","volume":"196","author":"G Beliakov","year":"2006","unstructured":"Beliakov G (2006) Interpolation of lipschitz functions. J Comput Appl Math 196(1):20\u201344","journal-title":"J Comput Appl Math"},{"key":"1878_CR4","doi-asserted-by":"crossref","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201dnearest neighbor\u201d meaningful? In: Proceedings of the 7th international conference on database theory. Springer, London, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"1878_CR5","doi-asserted-by":"crossref","unstructured":"Borenstein Y, Poli R (2006) Kolmogorov complexity, optimization and hardness. In: IEEE congress on evolutionary computation (CEC 2006), pp 112\u2013119","DOI":"10.1109\/CEC.2006.1688297"},{"key":"1878_CR6","unstructured":"Cheeseman P, Kanefsky B, Taylor W (1991) Where the really hard problems are. In: Proceedings of 12th international joint conference on AI, Morgan Kauffman, pp 331\u2013337"},{"key":"1878_CR7","unstructured":"Collard P, V\u00e9rel S, Clergue M (2004) Local search heuristics: fitness cloud versus fitness landscape. In: The 2004 European conference on artificial intelligence, IOS Press, pp 973\u2013974"},{"key":"1878_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"TM Cover","year":"1991","unstructured":"Cover TM, Thomas JA (1991) Elements of information theory. Wiley, New York"},{"key":"1878_CR9","volume-title":"Practical methods of optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher R (1987) Practical methods of optimization, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"1878_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9780470770801","volume-title":"Engineering design via surrogate modelling: a practical guide","author":"A Forrester","year":"2008","unstructured":"Forrester A, S\u00f3bester A, Keane A (2008) Engineering design via surrogate modelling: a practical guide. Wiley, Hoboken"},{"key":"1878_CR11","unstructured":"Gallagher M (2000) Multi-layer perceptron error surfaces: visualization, structure and modelling. PhD thesis, Department of Computer Science and Electrical Engineering, University of Queensland"},{"key":"1878_CR12","doi-asserted-by":"crossref","unstructured":"Gallagher M (2001) Fitness distance correlation of neural network error surfaces: a scalable, continuous optimization problem. In: Raedt LD, Flach P (eds) European conference on machine learning, Singapore, Lecture notes in artificial intelligence, vol 2167, pp 157\u2013166","DOI":"10.1007\/3-540-44795-4_14"},{"issue":"2","key":"1878_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1019956303894","volume":"16","author":"M Gallagher","year":"2002","unstructured":"Gallagher M, Downs T, Wood I (2002) Empirical evidence for ultrametric structure in multi-layer perceptron error surfaces. Neural Process Lett 16(2):177\u2013186","journal-title":"Neural Process Lett"},{"issue":"1\u20132","key":"1878_CR14","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","volume":"88","author":"I Gent","year":"1996","unstructured":"Gent I, Walsh T (1996) The TSP phase transition. Artif Intell 88(1\u20132):349\u2013358","journal-title":"Artif Intell"},{"key":"1878_CR15","volume-title":"Introduction to probability","author":"CM Grinstead","year":"2012","unstructured":"Grinstead CM, Snell JL (2012) Introduction to probability. American Mathematical Society, Providence"},{"key":"1878_CR16","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 3:1157\u20131182","journal-title":"J Mach Learn Res"},{"key":"1878_CR17","doi-asserted-by":"crossref","unstructured":"Hansen N (2000) Invariance, self-adaptation and correlated mutations in evolution strategies. In: Schoenauer\u00a0et al M (ed) Parallel problem solving from nature\u2014PPSN VI. Lecture notes in computer science, vol 1917, Springer, pp 355\u2013364","DOI":"10.1007\/3-540-45356-3_35"},{"key":"1878_CR18","unstructured":"Hansen N, Finck S, Ros R, Auger A (2010) Real-parameter black-box optimization benchmarking 2010: noiseless functions definitions. Technical Report, RR-6829, INRIA"},{"key":"1878_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global optimization: deterministic approaches","author":"R Horst","year":"1996","unstructured":"Horst R, Tuy H (1996) Global optimization: deterministic approaches. Springer, New Yotk"},{"key":"1878_CR20","doi-asserted-by":"crossref","unstructured":"Hutter F, Hamadi Y, Hoos H, Leyton-Brown K (2006) Performance prediction and automated tuning of randomized and parametric algorithms. In: Benhamou F (ed) Principles and practice of constraint programming. Lecture notes in computer science, vol 4204, Springer, pp 213\u2013228","DOI":"10.1007\/11889205_17"},{"issue":"1","key":"1878_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y (2005) A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput 9(1):3\u201312","journal-title":"Soft Comput"},{"key":"1878_CR22","unstructured":"Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th international conference on genetic algorithms. Morgan Kaufmann, San Francisco, CA, pp 184\u2013192"},{"issue":"1","key":"1878_CR23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386","journal-title":"Ann Math Stat"},{"key":"1878_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-39351-3","volume-title":"Nonlinear dimensionality reduction","author":"JA Lee","year":"2007","unstructured":"Lee JA, Verleysen M (2007) Nonlinear dimensionality reduction. Springer, New York"},{"key":"1878_CR25","doi-asserted-by":"crossref","unstructured":"Lunacek M, Whitley D (2006) The dispersion metric and the CMA evolution strategy. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 477\u2013484","DOI":"10.1145\/1143997.1144085"},{"key":"1878_CR26","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1002\/cplx.6130010511","volume":"5","author":"W Macready","year":"1996","unstructured":"Macready W, Wolpert D (1996) What makes an optimization problem hard. Complexity 5:40\u201346","journal-title":"Complexity"},{"key":"1878_CR27","doi-asserted-by":"crossref","unstructured":"Malan K, Engelbrecht A (2009) Quantifying ruggedness of continuous landscapes using entropy. In: IEEE congress on evolutionary computation, pp 1440\u20131447","DOI":"10.1109\/CEC.2009.4983112"},{"key":"1878_CR28","doi-asserted-by":"crossref","unstructured":"Mersmann O, Bischl B, Trautmann H, Preuss M, Weihs C, Rudolph G (2011) Exploratory landscape analysis. In: Proceedings of the 13th annual conference on genetic and evolutionary computation. ACM, New York, pp 829\u2013836","DOI":"10.1145\/2001576.2001690"},{"key":"1878_CR29","doi-asserted-by":"crossref","unstructured":"Morgan R, Gallagher M (2012) Length scale for characterising continuous optimization problems. In: Coello\u00a0et al CAC (ed) Parallel problem solving from nature\u2014PPSN XII. Lecture notes in computer science, vol 7491, Springer, pp 407\u2013416","DOI":"10.1007\/978-3-642-32937-1_41"},{"issue":"3","key":"1878_CR30","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/TEVC.2013.2281521","volume":"18","author":"R Morgan","year":"2014","unstructured":"Morgan R, Gallagher M (2014) Sampling techniques and distance metrics in high dimensional continuous landscape analysis: limitations and improvements. IEEE Trans Evol Comput 18(3):456\u2013461","journal-title":"IEEE Trans Evol Comput"},{"key":"1878_CR31","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz MA, Kirley M, Halgamuge S (2012a) A meta-learning prediction model of algorithm performance for continuous optimization problems. In: Coello\u00a0et al CAC (ed) Parallel problem solving from nature\u2014PPSN XII. Lecture notes in computer science, vol 7491, Springer, pp 226\u2013235","DOI":"10.1007\/978-3-642-32937-1_23"},{"key":"1878_CR32","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz MA, Kirley M, Halgamuge SK (2012b) Landscape characterization of numerical optimization problems using biased scattered data. In: IEEE congress on evolutionary computation, pp 1180\u20131187","DOI":"10.1109\/CEC.2012.6256490"},{"key":"1878_CR33","doi-asserted-by":"crossref","unstructured":"M\u00fcller C, Baumgartner B, Sbalzarini I (2009) Particle swarm CMA evolution strategy for the optimization of multi-funnel landscapes. In: IEEE congress on evolutionary computation, pp 2685\u20132692","DOI":"10.1109\/CEC.2009.4983279"},{"key":"1878_CR34","doi-asserted-by":"crossref","unstructured":"M\u00fcller CL, Sbalzarini IF (2011) Global characterization of the CEC 2005 fitness landscapes using fitness-distance analysis. In: Proceedings of the 2011 international conference on applications of evolutionary computation. vol Part I. Springer, Berlin, Heidelberg, pp 294\u2013303","DOI":"10.1007\/978-3-642-20525-5_30"},{"key":"1878_CR35","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718072","volume-title":"Numerical computing with IEEE floating point arithmetic","author":"M Overton","year":"2001","unstructured":"Overton M (2001) Numerical computing with IEEE floating point arithmetic. Cambridge University Press, Cambridge"},{"key":"1878_CR36","first-page":"161","volume-title":"Recent advances in intelligent engineering systems, studies in computational intelligence","author":"E Pitzer","year":"2012","unstructured":"Pitzer E, Affenzeller M (2012) A comprehensive survey on fitness landscape analysis. In: Fodor J, Klempous R, Su\u00e1rez\u00a0Araujo C (eds) Recent advances in intelligent engineering systems, studies in computational intelligence. Springer, New York, pp 161\u2013191"},{"key":"1878_CR37","doi-asserted-by":"crossref","unstructured":"Pitzer E, Affenzeller M, Beham A, Wagner S (2012) Comprehensive and automatic fitness landscape analysis using heuristiclab. In: Moreno-D\u00edaz R, Pichler F, Quesada-Arencibia A (eds) Computer aided systems theory\u2013EUROCAST 2011. Lecture notes in computer science, vol 6927, Springer, pp 424\u2013431","DOI":"10.1007\/978-3-642-27549-4_54"},{"issue":"1","key":"1878_CR38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/S0036144501395952","volume":"44","author":"C Reidys","year":"2002","unstructured":"Reidys C, Stadler P (2002) Combinatorial landscapes. SIAM Rev 44(1):3\u201354","journal-title":"SIAM Rev"},{"key":"1878_CR39","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice JR (1976) The algorithm selection problem. Adv Comput 15:65\u2013118","journal-title":"Adv Comput"},{"key":"1878_CR40","doi-asserted-by":"crossref","unstructured":"Ridge E, Kudenko D (2007) An analysis of problem difficulty for a class of optimisation heuristics. In: Proceedings of the 7th european conference on evolutionary computation in combinatorial optimization, Springer, pp 198\u2013209","DOI":"10.1007\/978-3-540-71615-0_18"},{"key":"1878_CR41","doi-asserted-by":"crossref","unstructured":"Ros\u00e9 H, Ebeling W, Asselmeyer T (1996) The density of states\u2014a measure of the difficulty of optimisation problems. In: Voigt\u00a0et al HM (ed) Parallel problem solving from nature PPSN IV. Lecture notes in computer science, vol 1141, Springer, pp 208\u2013217","DOI":"10.1007\/3-540-61723-X_985"},{"key":"1878_CR42","series-title":"Discrete mathematics and its applications","doi-asserted-by":"crossref","DOI":"10.1201\/9781439832905","volume-title":"Handbook of discrete and combinatorial mathematics","author":"K Rosen","year":"1999","unstructured":"Rosen K (1999) Handbook of discrete and combinatorial mathematics, 2nd edn., Discrete mathematics and its applicationsTaylor & Francis, Routledge","edition":"2"},{"key":"1878_CR43","first-page":"2812","volume":"4","author":"YD Sergeyev","year":"2010","unstructured":"Sergeyev YD, Kvasov DE (2010) Lipschitz global optimization. Wiley Encycl Oper Res Manag Sci 4:2812\u20132828","journal-title":"Wiley Encycl Oper Res Manag Sci"},{"key":"1878_CR44","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1111\/j.2517-6161.1991.tb01857.x","volume":"53","author":"S Sheather","year":"1991","unstructured":"Sheather S, Jones M (1991) A reliable data-based bandwidth selection method for kernel density estimation. J R Stat Soc Ser B (Methodological) 53:683\u2013690","journal-title":"J R Stat Soc Ser B (Methodological)"},{"key":"1878_CR45","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1103\/PhysRevLett.58.1100","volume":"58","author":"MF Shlesinger","year":"1987","unstructured":"Shlesinger MF, West BJ, Klafter J (1987) L\u00e9vy dynamics of enhanced diffusion: application to turbulence. Phys Rev Lett 58:1100\u20131103","journal-title":"Phys Rev Lett"},{"issue":"1","key":"1878_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365602317301754","volume":"10","author":"T Smith","year":"2002","unstructured":"Smith T, Husbands P, O\u2019Shea M (2002) Fitness landscapes and evolvability. Evol Comput 10(1):1\u201334","journal-title":"Evol Comput"},{"issue":"1","key":"1878_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"K Smith-Miles","year":"2008","unstructured":"Smith-Miles K (2008) Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput Surv 41(1):1\u201325","journal-title":"ACM Comput Surv"},{"issue":"5","key":"1878_CR48","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles K, Lopes L (2011) Measuring instance difficulty for combinatorial optimization problems. Comput Oper Res 39(5):875\u2013889","journal-title":"Comput Oper Res"},{"key":"1878_CR49","doi-asserted-by":"crossref","unstructured":"Smith-Miles K, Tan TT (2012) Measuring algorithm footprints in instance space. In: IEEE congress on evolutionary computation (CEC), pp 1\u20138","DOI":"10.1109\/CEC.2012.6252992"},{"key":"1878_CR50","doi-asserted-by":"crossref","unstructured":"Solla SA, Sorkin GB, White SR (1986) Configuration space analysis for optimization problems. In: et al EB (ed) Disordered systems and biological organization, NATO ASI Series, vol F20, Springer, Berlin, New York, pp 283\u2013293","DOI":"10.1007\/978-3-642-82657-3_28"},{"key":"1878_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"PF Stadler","year":"1996","unstructured":"Stadler PF (1996) Landscapes and their correlation functions. J Math Chem 20:1\u201345","journal-title":"J Math Chem"},{"key":"1878_CR52","doi-asserted-by":"crossref","unstructured":"Stadler PF (2002) Fitness landscapes. In: L\u00e4ssig M, Valleriani A (eds) Biological evolution and statistical physics. Lecture notes in physics, vol 585, Springer, pp 183\u2013204","DOI":"10.1007\/3-540-45692-9_10"},{"issue":"4","key":"1878_CR53","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0375-9601(92)90557-3","volume":"161","author":"PF Stadler","year":"1992","unstructured":"Stadler PF, Schnabl W (1992) The landscape of the traveling salesman problem. Phys Lett A 161(4):337\u2013344","journal-title":"Phys Lett A"},{"key":"1878_CR54","doi-asserted-by":"crossref","unstructured":"Steer K, Wirth A, Halgamuge S (2008) Information theoretic classification of problems for metaheuristics. In: Li\u00a0et al X (ed) Simulated evolution and learning, Lecture notes in computer science, vol 5361, Springer, pp 319\u2013328","DOI":"10.1007\/978-3-540-89694-4_33"},{"key":"1878_CR55","first-page":"549","volume":"11","author":"R Strongin","year":"1973","unstructured":"Strongin R (1973) On the convergence of an algorithm for finding a global extremum. Eng Cybern 11:549\u2013555","journal-title":"Eng Cybern"},{"key":"1878_CR56","series-title":"Wiley series on parallel and distributed computing","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"E Talbi","year":"2009","unstructured":"Talbi E (2009) Metaheuristics: from design to implementation., Wiley series on parallel and distributed computingWiley, Hoboken"},{"issue":"11","key":"1878_CR57","first-page":"2579","volume":"9","author":"L Maaten Van der","year":"2008","unstructured":"Van der Maaten L, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9(11):2579\u20132605","journal-title":"J Mach Learn Res"},{"key":"1878_CR58","first-page":"122","volume":"3448","author":"J Hemert van","year":"2005","unstructured":"van Hemert J (2005) Property analysis of symmetric travelling salesman problem instances acquired through evolution. Evol Comput Comb Optim 3448:122\u2013131","journal-title":"Evol Comput Comb Optim"},{"key":"1878_CR59","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1162\/106365600568095","volume":"8","author":"VK Vassilev","year":"2000","unstructured":"Vassilev VK, Fogarty TC, Miller JF (2000) Information characteristics and the structure of landscapes. Evol Comput 8:31\u201360","journal-title":"Evol Comput"},{"key":"1878_CR60","doi-asserted-by":"crossref","unstructured":"Wang Y, Li B (2008) Understand behavior and performance of real coded optimization algorithms via nk-linkage model. In: IEEE world congress on computational intelligence, pp 801\u2013808","DOI":"10.1109\/CEC.2008.4630888"},{"key":"1878_CR61","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E Weinberger","year":"1990","unstructured":"Weinberger E (1990) Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybern 63:325\u2013336","journal-title":"Biol Cybern"},{"key":"1878_CR62","doi-asserted-by":"crossref","unstructured":"Whitley D, Watson JP (2005) Complexity theory and the no free lunch theorem. In: Search methodologies, Springer, pp 317\u2013339","DOI":"10.1007\/0-387-28356-0_11"},{"key":"1878_CR63","doi-asserted-by":"crossref","unstructured":"Whitley D, Lunacek M, Sokolov A (2006) Comparing the niches of CMA-ES, CHC and pattern search using diverse benchmarks. In: Runarsson\u00a0et al TP (ed) Parallel problem solving from nature\u2014PPSN IX. Lecture notes in computer science, vol 4193, Springer, pp 988\u2013997","DOI":"10.1007\/11844297_100"},{"key":"1878_CR64","first-page":"91","volume":"8","author":"GR Wood","year":"1996","unstructured":"Wood GR, Zhang BP (1996) Estimation of the Lipschitz constant of a function. J Glob Optim 8:91\u2013103","journal-title":"J Glob Optim"},{"issue":"1","key":"1878_CR65","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.1389","volume":"21","author":"W Zhang","year":"2004","unstructured":"Zhang W (2004) Phase transitions and backbones of the asymmetric traveling salesman problem. J Artif Intell Res 21(1):471\u2013497","journal-title":"J Artif Intell Res"},{"issue":"1\u20132","key":"1878_CR66","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0004-3702(95)00054-2","volume":"81","author":"W Zhang","year":"1996","unstructured":"Zhang W, Korf RE (1996) A study of complexity transitions on the asymmetric traveling salesman problem. Artif Intell 81(1\u20132):223\u2013239","journal-title":"Artif Intell"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1878-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1878-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1878-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1878-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T10:34:55Z","timestamp":1718102095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1878-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,25]]},"references-count":66,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1878"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1878-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,25]]}}}