{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T05:51:49Z","timestamp":1794376309198,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540263197","type":"print"},{"value":"9783540316732","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11499305_9","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T01:39:11Z","timestamp":1270777151000},"page":"84-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Cotta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","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":"9_CR2","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":"9_CR3","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":"9_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","volume":"57","author":"D. 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":"9_CR5","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BF01075212","volume":"25","author":"V. 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":"9_CR6","unstructured":"Hallet, M.: An integrated complexity analysis of problems from computational biology. PhD thesis, University of Victoria (1996)"},{"key":"9_CR7","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":"9_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1093\/bioinformatics\/btg1073","volume":"19","author":"S. Rahmann","year":"2003","unstructured":"Rahmann, S.: The shortest common supersequence problem in a microarray production setting. Bioinformatics\u00a019, ii156\u2013ii161(2003)","journal-title":"Bioinformatics"},{"key":"9_CR9","unstructured":"Branke, J., Middendorf, M.: Searching for shortest common supersequences by means of a heuristic based genetic algorithm. In: Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications, pp. 105\u2013114. Finnish Artificial Intelligence Society (1996)"},{"key":"9_CR10","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1998","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"key":"9_CR11","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.A., 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":"9_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters\u00a073, 125\u2013129 (2000)","journal-title":"Information Processing Letters"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"9_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.: A hybrid GRASP-evolutionary algorithm approach to golomb ruler search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 481\u2013490. Springer, Heidelberg (2004)"},{"key":"9_CR15","volume-title":"Nonparametric Statistical Methods Based on Ranks","author":"E.L. Lehmann","year":"1975","unstructured":"Lehmann, E.L.: Nonparametric Statistical Methods Based on Ranks. McGraw-Hill, New York (1975)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499305_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T16:23:13Z","timestamp":1584462193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499305_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263197","9783540316732"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11499305_9","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b137296","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}