{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:19:52Z","timestamp":1725574792325},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262084"},{"type":"electronic","value":"9783540321064"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494669_7","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T14:48:09Z","timestamp":1294930089000},"page":"50-58","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/http\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Cotta","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","volume":"57","author":"D.E. Foulser","year":"1992","unstructured":"Foulser, D., Li, M., Yang, Q.: Theory and algorithms for plan merging. Artificial Intelligence\u00a057, 143\u2013181 (1992)","journal-title":"Artificial Intelligence"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BF01075212","volume":"25","author":"V.G. Timkovsky","year":"1990","unstructured":"Timkovsky, V.: Complexity of common subsequence and supersequence problems and related problems. Cybernetics\u00a025, 565\u2013580 (1990)","journal-title":"Cybernetics"},{"key":"7_CR3","unstructured":"Hallet, M.: An integrated complexity analysis of problems from computational biology. PhD thesis, University of Victoria (1996)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(94)00251-D","volume":"147","author":"H. Bodlaender","year":"1994","unstructured":"Bodlaender, H., Downey, R., Fellows, M., Wareham, H.: The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science\u00a0147, 31\u201354 (1994)","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(92)00074-2","volume":"125","author":"M. Middendorf","year":"1994","unstructured":"Middendorf, M.: More on the complexity of common superstring and supersequence problems. Theoretical Computer Science\u00a0125, 205\u2013228 (1994)","journal-title":"Theoretical Computer Science"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K. Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences\u00a067, 757\u2013771 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR7","unstructured":"Fraser, C.: Subsequences and Supersequences. PhD thesis, University of Glasgow, Department of Computer Science (1995)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01545528","volume":"20","author":"J. Branke","year":"1998","unstructured":"Branke, J., Middendorf, M., Schneider, F.: Improved heuristics and a genetic algorithm for finding short supersequences. OR-Spektrum\u00a020, 39\u201345 (1998)","journal-title":"OR-Spektrum"},{"key":"7_CR9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1998","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"key":"7_CR10","first-page":"251","volume-title":"Artificial Neural Nets and Genetic Algorithms","author":"C. Cotta","year":"1998","unstructured":"Cotta, C., Troya, J.: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In: Smith, G., Steele, N., Albrecht, R. (eds.) Artificial Neural Nets and Genetic Algorithms, Wien New York, pp. 251\u2013255. Springer, Heidelberg (1998)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"7_CR12","first-page":"1","volume":"9","author":"M. Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Parameter variation in GRASP procedures. Investigaci\u00f3n Operativa\u00a09, 1\u201320 (2000)","journal-title":"Investigaci\u00f3n Operativa"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing\u00a012, 164\u2013176 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-30217-9_49","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"C. Cotta","year":"2004","unstructured":"Cotta, C., Fern\u00e1ndez, A.J.: A hybrid GRASP \u2013 evolutionary algorithm approach to golomb ruler search. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 481\u2013490. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Bioinspired Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/11494669_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T20:24:18Z","timestamp":1584476658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/11494669_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262084","9783540321064"],"references-count":14,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/11494669_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}