{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:57:08Z","timestamp":1743109028747,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030040697"},{"type":"electronic","value":"9783030040703"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04070-3_12","type":"book-chapter","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T13:56:27Z","timestamp":1542808587000},"page":"152-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Design of (Almost) Disjunct Matrices by Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Karlo","family":"Knezevic","sequence":"first","affiliation":[]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Leporati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,22]]},"reference":[{"key":"12_CR1","unstructured":"Balint, G., et al.: An investigation of $$d$$-separable, $$\\bar{d}$$-separable, and $$d$$-disjunct binary matrices. Technical report, San Diego State University (2013). http:\/\/www.sci.sdsu.edu\/math-reu\/2013-2.pdf"},{"issue":"11","key":"12_CR2","doi-asserted-by":"publisher","first-page":"7131","DOI":"10.1109\/TIT.2017.2746564","volume":"63","author":"A Barg","year":"2017","unstructured":"Barg, A., Mazumdar, A.: Group testing schemes from codes and designs. IEEE Trans. Inf. Theory 63(11), 7131\u20137141 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-46049-9_14","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2016","unstructured":"Belazzougui, D., Gagie, T., M\u00e4kinen, V., Previtali, M.: Fully dynamic De Bruijn graphs. In: Inenaga, S., Sadakane, K., Sakai, T. (eds.) SPIRE 2016. LNCS, vol. 9954, pp. 145\u2013152. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46049-9_14"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H.: Combinatorial designs. In: Handbook of Discrete and Combinatorial Mathematics. CRC Press (1999)","DOI":"10.1201\/9781439832905.ch12"},{"issue":"1\u20133","key":"12_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/B:DESI.0000029213.74879.e0","volume":"32","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn, C.J., Ling, A.C.H., Syrotiuk, V.R.: Cover-free families and topology-transparent scheduling for manets. Des. Codes Cryptogr. 32(1\u20133), 65\u201395 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-319-73117-9_37","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"P Damaschke","year":"2018","unstructured":"Damaschke, P., Schliep, A.: An optimization problem related to bloom filters with bit patterns. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 525\u2013538. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_37"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Du, D., Hwang, F.K., Hwang, F.: Combinatorial Group Testing and Its Applications, vol. 12. World Scientific, Singapore (2000)","DOI":"10.1142\/4252"},{"key":"12_CR8","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-05094-1"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10(4), 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"12_CR10","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10732-012-9208-4","volume":"18","author":"P Larra\u00f1aga","year":"2012","unstructured":"Larra\u00f1aga, P., Karshenas, H., Bielza, C., Santana, R.: A review on probabilistic graphical models in evolutionary computation. J. Heuristics 18(5), 795\u2013819 (2012)","journal-title":"J. Heuristics"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Mariot, L., Leporati, A.: Heuristic search by particle swarm optimization of boolean functions for cryptographic applications. In: Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, 11\u201315 July 2015, Companion Material Proceedings, pp. 1425\u20131426 (2015)","DOI":"10.1145\/2739482.2764674"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, 15\u201319 July 2017, pp. 306\u2013313 (2017)","DOI":"10.1145\/3071178.3071284"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-99253-2_10","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary search of binary orthogonal arrays. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 121\u2013133. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_10"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-35261-4_67","volume-title":"Algorithms and Computation","author":"A Mazumdar","year":"2012","unstructured":"Mazumdar, A.: On almost disjunct matrices for group testing. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 649\u2013658. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35261-4_67"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"M\u00fchlenbein, H.: The equation for response to selection and its use for prediction. Evol. Comput. 5(3), 303\u2013346 (1997). https:\/\/doi.org\/10.1162\/evco.1997.5.3.303","DOI":"10.1162\/evco.1997.5.3.303"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178\u2013187. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_982"},{"key":"12_CR17","volume-title":"Causality: Models, Reasoning and Inference","author":"J Pearl","year":"2000","unstructured":"Pearl, J.: Causality: Models, Reasoning and Inference. Cambridge University Press, New York (2000)"},{"key":"12_CR18","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008). http:\/\/lulu.com, http:\/\/www.gp-field-guide.org.uk. (With contributions by J. R. Koza)"},{"issue":"12","key":"12_CR19","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1109\/TIT.2011.2163296","volume":"57","author":"E Porat","year":"2011","unstructured":"Porat, E., Rothschild, A.: Explicit nonadaptive combinatorial group testing schemes. IEEE Trans. Inf. Theory 57(12), 7982\u20137989 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR20","unstructured":"Safadi, R., Wang, R.: The use of genetic algorithms in the construction of mixed multilevel orthogonal arrays. Technical report, OLIN CORP CHESHIRE CT OLIN RESEARCH CENTER (1992)"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"2000","unstructured":"Stinson, D.R., Van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plan. Inference 86(2), 595\u2013617 (2000)","journal-title":"J. Stat. Plan. Inference"},{"issue":"1\u20133","key":"12_CR22","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0012-365X(03)00287-5","volume":"279","author":"DR Stinson","year":"2004","unstructured":"Stinson, D.R., Wei, R.: Generalized cover-free families. Discret. Math. 279(1\u20133), 463\u2013477 (2004)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04070-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T14:13:13Z","timestamp":1614867193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04070-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030040697","9783030040703"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04070-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"22 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tpnc2018.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}