{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:50:35Z","timestamp":1709826635252},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,5]],"date-time":"2009-02-05T00:00:00Z","timestamp":1233792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s00224-009-9169-7","type":"journal-article","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T19:10:39Z","timestamp":1233774639000},"page":"773-786","source":"Crossref","is-referenced-by-count":2,"title":["Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems"],"prefix":"10.1007","volume":"45","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,5]]},"reference":[{"key":"9169_CR1","unstructured":"Akama, Y., Zeugmann, T.: Consistent and coherent learning with \u03b4-delay. Technical Report TCS-TR-A-07-29, Hokkaido Univ., October 2007"},{"key":"9169_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.2178\/jsl\/1080938842","volume":"69","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Case, J., Jain, S., Suraj, M.: Parsimony hierarchies for inductive inference. J.\u00a0Symb. Log. 69, 287\u2013328 (2004)","journal-title":"J.\u00a0Symb. Log."},{"issue":"2","key":"9169_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"9169_CR4","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/malq.19960420138","volume":"42","author":"C. Ash","year":"1996","unstructured":"Ash, C., Knight, J.: Recursive structures and Eshov\u2019s hierarchy. Math. Log. Q. 42, 461\u2013468 (1996)","journal-title":"Math. Log. Q."},{"key":"9169_CR5","doi-asserted-by":"crossref","unstructured":"Baliga, G., Case, J., Merkle, W., Stephan, F., Wiehagen, W.: When unlearning helps. Inf. Comput. (2007, accepted)","DOI":"10.1016\/j.ic.2007.10.005"},{"key":"9169_CR6","first-page":"82","volume-title":"Theory of Algorithms and Programs","author":"J. B\u0101rzdi\u0146\u0161","year":"1974","unstructured":"B\u0101rzdi\u0146\u0161, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, vol. 210, pp. 82\u201388. Latvian State University, Riga (1974)"},{"key":"9169_CR7","first-page":"101","volume":"210","author":"J. B\u0101rzdi\u0146\u0161","year":"1974","unstructured":"B\u0101rzdi\u0146\u0161, J., Freivalds, R.: Prediction and limiting synthesis of recursively enumerable classes of functions. Latvijas Valsts Univ. Zinatn. Raksti 210, 101\u2013111 (1974)","journal-title":"Latvijas Valsts Univ. Zinatn. Raksti"},{"key":"9169_CR8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-540-87987-9_30","volume-title":"19th International Conference on Algorithmic Learning Theory (ALT\u201908)","author":"L. Becerra-Bonache","year":"2008","unstructured":"Becerra-Bonache, L., Case, J., Jain, S., Stephan, F.: Iterative learning of simple external contextual languages. In: 19th International Conference on Algorithmic Learning Theory (ALT\u201908), vol.\u00a05254, pp. 359\u2013373. Springer, Berlin (2008). Invited for submission to the associated Special Issue of TCS"},{"key":"9169_CR9","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J.\u00a0Comput. 26, 1411\u20131473 (1997)","journal-title":"SIAM J.\u00a0Comput."},{"key":"9169_CR10","first-page":"322","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine independent theory of the complexity of recursive functions. J.\u00a0ACM 14, 322\u2013336 (1967)","journal-title":"J.\u00a0ACM"},{"key":"9169_CR11","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1016\/j.ic.2007.04.001","volume":"205","author":"L. Carlucci","year":"2007","unstructured":"Carlucci, L., Case, J., Jain, S., Stephan, F.: Memory-limited U-shaped learning. Inf. Comput. 205, 1551\u20131573 (2007)","journal-title":"Inf. Comput."},{"key":"9169_CR12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.jcss.2007.06.013","volume":"74","author":"L. Carlucci","year":"2008","unstructured":"Carlucci, L., Case, J., Jain, S., Stephan, F.: Non u-shaped vacillatory and team learning. J.\u00a0Comput. Syst. Sci. 74, 409\u2013430 (2008). Special issue in memory of Carl Smith","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"6","key":"9169_CR13","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1137\/S0097539793249694","volume":"28","author":"J. Case","year":"1999","unstructured":"Case, J.: The power of vacillation in language learning. SIAM J.\u00a0Comput. 28(6), 1941\u20131969 (1999)","journal-title":"SIAM J.\u00a0Comput."},{"key":"9169_CR14","series-title":"International Mathematical Series","volume-title":"Mathematical Problems from Applied Logic II. New Logics for the XXIst Century","author":"J. Case","year":"2007","unstructured":"Case, J.: Directions for computability theory beyond pure mathematical. In: Gabbay, D., Goncharov,\u00a0S., Zakharyaschev,\u00a0M. (eds.) Mathematical Problems from Applied Logic II. New Logics for the XXIst Century. International Mathematical Series, vol.\u00a05. Springer, Berlin (2007)"},{"key":"9169_CR15","unstructured":"Case, J., Jain, S.: Inductive inference (2007). http:\/\/www.cis.udel.edu\/case\/papers\/ind-inf-ml.pdf ; draft of article invited for C. Sammut\u2019s upcoming, Encyclopedia of Machine Learning"},{"key":"9169_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-540-87987-9_32","volume-title":"19th International Conference on Algorithmic Learning Theory (ALT\u201908)","author":"J. Case","year":"2008","unstructured":"Case, J., K\u00f6tzing, T.: Dynamically delayed postdictive completeness and consistency in learning. In: 19th International Conference on Algorithmic Learning Theory (ALT\u201908). Lecture Notes in Artificial Intelligence, vol. 5254, pp. 389\u2013403. Springer, Berlin (2008)"},{"key":"9169_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Proceedings of the 9th International Colloquium on Automata, Languages and Programming","author":"J. Case","year":"1982","unstructured":"Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt,\u00a0E. (eds.) Proceedings of the 9th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 140, pp. 107\u2013115. Springer, Berlin (1982)"},{"key":"9169_CR18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10994-008-5047-9","volume":"72","author":"J. Case","year":"2008","unstructured":"Case, J., Moelius, S.: U-shaped, iterative, and iterative-with-counter learning. Mach. Learn. 72, 63\u201388 (2008). Special issue for selected papers from COLT\u201907","journal-title":"Mach. Learn."},{"key":"9169_CR19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theor. Comput. Sci. 25, 193\u2013220 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"9169_CR20","first-page":"23","volume":"30","author":"J. Case","year":"1994","unstructured":"Case, J., Jain, S., Ngo Manguelle, S.: Refinements of inductive inference by Popperian and reliable machines. Kybernetika 30, 23\u201352 (1994)","journal-title":"Kybernetika"},{"key":"9169_CR21","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1006\/inco.1998.2784","volume":"152","author":"J. Case","year":"1999","unstructured":"Case, J., Jain, S., Lange, S., Zeugmann, T.: Incremental concept learning for bounded data mining. Inf. Comput. 152, 74\u2013110 (1999)","journal-title":"Inf. Comput."},{"key":"9169_CR22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.apal.2005.06.013","volume":"139","author":"J. Case","year":"2006","unstructured":"Case, J., Chen, K., Jain, S., Merkle, W., Royer, J.: Generality\u2019s price: inescapable deficiencies in machine-learned programs. Ann. Pure Appl. Logic 139, 303\u2013326 (2006)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9169_CR23","series-title":"Lecture Notes in Artificial Intelligence","first-page":"26","volume-title":"18th International Conference on Algorithmic Learning Theory (ALT\u201907)","author":"J. Case","year":"2007","unstructured":"Case, J., K\u00f6tzing, T., Paddock, T.: Feasible iteration of feasible learning functionals. In: Hutter, M., Servedio, R., Takimoto, E. (eds.) 18th International Conference on Algorithmic Learning Theory (ALT\u201907). Lecture Notes in Artificial Intelligence, vol. 4754, pp. 26\u201340. Springer, Berlin (2007)"},{"key":"9169_CR24","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"9169_CR25","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/S0019-9958(86)80042-0","volume":"69","author":"R. Daley","year":"1986","unstructured":"Daley, R., Smith, C.: On the complexity of inductive inference. Inf. Control 69, 12\u201340 (1986)","journal-title":"Inf. Control"},{"key":"9169_CR26","series-title":"Monographs in Computer Science","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1998","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Monographs in Computer Science. Springer, Berlin (1998)"},{"key":"9169_CR27","doi-asserted-by":"crossref","unstructured":"Downey, R., Evans, P., Fellows, M.: Parameterized learning complexity. In Proceedings of the Sixth ACM Workshop on Computational Learning Theory (COLT\u201993), pp.\u00a051\u201357 (1993)","DOI":"10.1145\/168304.168311"},{"issue":"1","key":"9169_CR28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02218750","volume":"7","author":"Y. Ershov","year":"1968","unstructured":"Ershov, Y.: A hierarchy of sets, I. Algebra Log. 7(1), 47\u201374 (1968) (in Russian). English translation in Algebra Log. 7, 25\u201343 (1968)","journal-title":"Algebra Log."},{"key":"9169_CR29","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF02218664","volume":"7","author":"Y. Ershov","year":"1968","unstructured":"Ershov, Y.: A hierarchy of sets II. Algebra Log. 7, 212\u2013232 (1968)","journal-title":"Algebra Log."},{"issue":"2","key":"9169_CR30","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1006\/inco.1993.1068","volume":"107","author":"R. Freivalds","year":"1993","unstructured":"Freivalds, R., Smith, C.: On the role of procrastination in machine learning. Inf. Comput. 107(2), 237\u2013271 (1993)","journal-title":"Inf. Comput."},{"issue":"3","key":"9169_CR31","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/S0022-0000(05)80072-8","volume":"49","author":"M. Fulk","year":"1994","unstructured":"Fulk, M., Jain, S., Osherson, D.: Open problems in systems that learn. J.\u00a0Comput. Syst. Sci. 49(3), 589\u2013604 (1994)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9169_CR32","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language identification in the limit. Inf. Control 10, 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"9169_CR33","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 285\u2013306 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"9169_CR34","volume-title":"Introduction to Numerical Analysis","author":"F. Hildebrand","year":"1956","unstructured":"Hildebrand, F.: Introduction to Numerical Analysis. McGraw-Hill, New York (1956)"},{"key":"9169_CR35","volume-title":"Introduction to Automata Theory Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"9169_CR36","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1017\/S0956796800003841","volume":"11","author":"R. Irwin","year":"2001","unstructured":"Irwin, R., Kapron, B., Royer, J.: On characterizations of the basic feasible functional, Part I. J.\u00a0Funct. Program. 11, 117\u2013153 (2001)","journal-title":"J.\u00a0Funct. Program."},{"key":"9169_CR37","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/inco.1996.2614","volume":"132","author":"S. Jain","year":"1997","unstructured":"Jain, S., Sharma, A.: Elementary formal systems, intrinsic complexity, and procrastination. Inf. Comput. 132, 65\u201384 (1997)","journal-title":"Inf. Comput."},{"key":"9169_CR38","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn: An Introduction to Learning Theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn: An Introduction to Learning Theory. 2nd edn. MIT Press, Cambridge (1999)","edition":"2"},{"key":"9169_CR39","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"B. Kapron","year":"1996","unstructured":"Kapron, B., Cook, S.: A new characterization of type 2 feasibility. SIAM J.\u00a0Comput. 25, 117\u2013132 (1996)","journal-title":"SIAM J.\u00a0Comput."},{"key":"9169_CR40","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Vazirani, U.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"9169_CR41","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1006\/inco.1995.1170","volume":"123","author":"E. Kinber","year":"1995","unstructured":"Kinber, E., Stephan, F.: Language learning from texts: mind changes, limited memory and monotonicity. Inf. Comput. 123, 224\u2013241 (1995)","journal-title":"Inf. Comput."},{"key":"9169_CR42","volume-title":"Set Theory","author":"K. Kuratowski","year":"1967","unstructured":"Kuratowski, K., Mostowski, A.: Set Theory. North-Holland, Amsterdam (1967)"},{"key":"9169_CR43","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1006\/jcss.1996.0051","volume":"53","author":"S. Lange","year":"1996","unstructured":"Lange, S., Zeugmann, T.: Incremental learning from positive data. J.\u00a0Comput. Syst. Sci. 53, 88\u2013103 (1996)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9169_CR44","series-title":"Monographs of the Society for Research in Child Development","volume-title":"Overregularization in Language Acquisition","author":"G. Marcus","year":"1992","unstructured":"Marcus, G., Pinker, S., Ullman, M., Hollander, M., Rosen, T.J., Xu, F.: Overregularization in Language Acquisition. Monographs of the Society for Research in Child Development, vol. 57(4). University of Chicago Press, Chicago (1992). Includes commentary by H. Clahsen"},{"key":"9169_CR45","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(76)80035-9","volume":"12","author":"K. Mehlhorn","year":"1976","unstructured":"Mehlhorn, K.: Polynomial and abstract subrecursive classes. J.\u00a0Comput. Syst. Sci. 12, 147\u2013178 (1976)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9169_CR46","doi-asserted-by":"crossref","first-page":"48","DOI":"10.2307\/2272544","volume":"37","author":"A. Meyer","year":"1972","unstructured":"Meyer, A., Fischer, P.: Computational speed-up by effective operators. J.\u00a0Symb. Log. 37, 48\u201368 (1972)","journal-title":"J.\u00a0Symb. Log."},{"key":"9169_CR47","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory, vol. II. Elsevier, Amsterdam (1999)"},{"key":"9169_CR48","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-51734-0_50","volume-title":"Analogical and Inductive Inference, Proceedings of the Second International Workshop (A\u201989)","author":"L. Pitt","year":"1989","unstructured":"Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Analogical and Inductive Inference, Proceedings of the Second International Workshop (A\u201989). Lecture Notes in Artificial Intelligence, vol. 397, pp. 18\u201344. Springer, Berlin (1989)"},{"issue":"1","key":"9169_CR49","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0010-0277(91)90022-V","volume":"38","author":"K. Plunkett","year":"1991","unstructured":"Plunkett, K., Marchman, V.: U-shaped learning and frequency effects in a multi-layered perceptron: implications for child language acquisition. Cognition 38(1), 43\u2013102 (1991)","journal-title":"Cognition"},{"issue":"2","key":"9169_CR50","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1006\/jcss.1999.1669","volume":"60","author":"R. Reischuk","year":"2000","unstructured":"Reischuk, R., Zeugmann, T.: An average-case optimal one-variable pattern language learner. J.\u00a0Comput. Syst. Sci. 60(2), 302\u2013335 (2000). Special Issue for COLT\u201998","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9169_CR51","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967). Reprinted, MIT Press, Cambridge (1987)"},{"key":"9169_CR52","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0249-3","volume-title":"Subrecursive Programming Systems: Complexity and Succinctness","author":"J. Royer","year":"1994","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems: Complexity and Succinctness. Progress in Theoretical Computer Science. Birkh\u00e4user Boston, Cambridge (1994)"},{"key":"9169_CR53","volume-title":"Cardinal and Ordinal Numbers","author":"W. Sierpinski","year":"1965","unstructured":"Sierpinski, W.: Cardinal and Ordinal Numbers, 2nd edn. PWN, Warsaw (1965).","edition":"2"},{"key":"9169_CR54","unstructured":"Sipser, M.: Private communication (1978)"},{"key":"9169_CR55","series-title":"Developmental Psychology Series","volume-title":"U-Shaped Behavioral Growth","year":"1982","unstructured":"Strauss, S., Stavy, R. (eds.): U-Shaped Behavioral Growth. Developmental Psychology Series. Academic Press, San Diego (1982)"},{"issue":"2","key":"9169_CR56","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0010-0277(02)00176-2","volume":"86","author":"N. Taatgen","year":"2002","unstructured":"Taatgen, N., Anderson, J.: Why do children learn to say broke? A model of learning the past tense without feedback. Cognition 86(2), 123\u2013155 (2002)","journal-title":"Cognition"},{"key":"9169_CR57","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L.: A theory of the learnable. Commun. ACM 27, 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"9169_CR58","first-page":"93","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"Wiehagen, R.: Limes-erkennung rekursiver funktionen durch spezielle strategien. Electronische Informationverarbeitung und Kybernetik 12, 93\u201399 (1976)","journal-title":"Electronische Informationverarbeitung und Kybernetik"},{"key":"9169_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-3-540-75225-7_20","volume-title":"18th International Conference on Algorithmic Learning Theory (ALT\u201907)","author":"R. Yoshinaka","year":"2007","unstructured":"Yoshinaka, R.: Learning efficiency of very simple grammars from positive data. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) 18th International Conference on Algorithmic Learning Theory (ALT\u201907). Lecture Notes in Computer Science, vol.\u00a04754, pp.\u00a0227\u2013241. Springer, Berlin (2007)"},{"key":"9169_CR60","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.tcs.2006.07.042","volume":"364","author":"T. Zeugmann","year":"2006","unstructured":"Zeugmann, T.: From learning in the limit to stochastic finite learning. Theor. Comput. Sci. 364, 77\u201397 (2006). Special Issue for ALT\u201996","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9169-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-009-9169-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9169-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T10:33:20Z","timestamp":1589538800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9169-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,5]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9169"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9169-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,5]]}}}