{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:09:46Z","timestamp":1778252986315,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540213789","type":"print"},{"value":"9783540246534","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24653-4_3","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T10:08:30Z","timestamp":1294826910000},"page":"21-30","source":"Crossref","is-referenced-by-count":26,"title":["Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Cotta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Sloper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Moscato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"41","volume-title":"AAAI Symposium on Intelligent Relevance","author":"S. Davies","year":"1994","unstructured":"Davies, S., Russell, S.: NP-completeness of searches for smallest possible feature sets. In: Greiner, R., Subramanian, D. (eds.) AAAI Symposium on Intelligent Relevance, New Orleans, pp. 41\u201343. AAAI Press, Menlo Park (1994)"},{"key":"3_CR2","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1998","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-46784-X_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Chen","year":"1999","unstructured":"Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 313\u2013324. Springer, Heidelberg (1999)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R. Downey","year":"1995","unstructured":"Downey, R., Fellows, M.: Fixed parameter tractability and completeness I: Basic theory. SIAM Journal of Computing\u00a024, 873\u2013921 (1995)","journal-title":"SIAM Journal of Computing"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/S0022-0000(03)00081-3","volume":"67","author":"C. Cotta","year":"2003","unstructured":"Cotta, C., Moscato, P.: The k-Feature Set problem is W[2]-complete. Journal of Computer and Systems Science\u00a067, 686\u2013690 (2003)","journal-title":"Journal of Computer and Systems Science"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J. Harant","year":"1999","unstructured":"Harant, J., Pruchnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Combinatorics, Probability and Computing\u00a08, 547\u2013553 (1999)","journal-title":"Combinatorics, Probability and Computing"},{"key":"3_CR7","unstructured":"Weihe, K.: Covering trains by stations or the power of data reduction. In: Battiti, R., Bertossi, A. (eds.) Proceedings of Algorithms and Experiments (Alex 98), Trento, Italy, pp. 1\u20138 (1998)"},{"key":"3_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1038\/35000501","volume":"403","author":"A. Alizadeh","year":"2001","unstructured":"Alizadeh, A., et al.: Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature\u00a0403, 503\u2013511 (2001)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24653-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:13:17Z","timestamp":1778249597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24653-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213789","9783540246534"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24653-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}