{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:07:33Z","timestamp":1760645253039},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650782"},{"type":"electronic","value":"9783540496724"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056911","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T00:49:17Z","timestamp":1154306957000},"page":"692-701","source":"Crossref","is-referenced-by-count":58,"title":["An island model based ant system with lookahead for the shortest supersequence problem"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"Michel","sequence":"first","affiliation":[]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01545528","volume":"20","author":"J. Branke","year":"1998","unstructured":"J. Branke, M. Middendorf, and F. Schneider. Improved heuristics and a genetic algorithm for finding short supersequences. OR-Spektrum, 20:39\u201346, 1998.","journal-title":"OR-Spektrum"},{"key":"68_CR2","unstructured":"B. Bullnheimer, R.F. Hartl, and C. Strau\u00df. Applying the ant system to the vehicle routing problem. In 2nd Int. Conference on Metaheuristics \u2014 MIC97, 1997."},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"M. Dorigo and L.M. Gambardella. Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning, pages 252\u2013260. Morgan Kaufmann, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"68_CR4","volume-title":"Technical Report No. 91-016","author":"M. Dorigo","year":"1991","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni. An autocatalytic optimizing process. Technical Report No. 91-016, Politecnico di Milano, Italy, 1991."},{"key":"68_CR5","volume-title":"Technical Report No. IRIDIA\/94-28","author":"M. Dorigo","year":"1994","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni. The ant system applied to the quadratic assignment problem. Technical Report No. IRIDIA\/94-28, Universite Libre de Bruxelles, Belguim, 1994."},{"issue":"1","key":"68_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics \u2014 Part B, 26(1):29\u201341, 1996.","journal-title":"IEEE Trans. Systems, Man, and Cybernetics \u2014 Part B"},{"key":"68_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","volume":"57","author":"D.E. Foulser","year":"1992","unstructured":"D.E. Foulser, M. Li, and Q. Yang. Theory and algorithms for plan merging. Artificial Intelligence, 57:143\u2013181, 1992.","journal-title":"Artificial Intelligence"},{"key":"68_CR8","unstructured":"C.B. Fraser. Subsequences and Supersequences of Strings. PhD thesis, Dept. of Computer Science, University of Glasgow, 1995."},{"key":"68_CR9","first-page":"303","volume":"2","author":"C.B. Fraser","year":"1995","unstructured":"C.B. Fraser and R.W. Irving. Approximation algorithms for the shortest common supersequence. Nordic Journal of Computing, 2:303\u2013325, 1995.","journal-title":"Nordic Journal of Computing"},{"key":"68_CR10","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"T. Jiang and M. Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput., 24:1122\u20131139, 1995.","journal-title":"SIAM J. Comput."},{"key":"68_CR11","unstructured":"U. Kohlmorgen, H. Schmeck, and K. Haase. Experiences with fine-grained parallel algorithms. to appear in Annals of Operations Research, 1997."},{"key":"68_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(92)00074-2","volume":"124","author":"M. Middendorf","year":"1994","unstructured":"M. Middendorf. More on the complexity of common superstring and supersequence problems. Theoret. Comput. Sci., 124:205\u2013228, 1994.","journal-title":"Theoret. Comput. Sci."},{"key":"68_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","volume":"16","author":"K.-J. R\u00e4ih\u00e4","year":"1981","unstructured":"K.-J. R\u00e4ih\u00e4 and E. Ukkonen. The shortest common supersequence problem over binary alphabet is NP-complete. Theoret. Comput. Sci., 16:187\u2013198, 1981.","journal-title":"Theoret. Comput. Sci."},{"key":"68_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BF01075212","volume":"25","author":"V. G. Timkovsky","year":"1990","unstructured":"V. G. Timkovsky. Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25:565\u2013580, 1990.","journal-title":"Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:16:38Z","timestamp":1555748198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650782","9783540496724"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0056911","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}