{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:22Z","timestamp":1759637962112,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642337567"},{"type":"electronic","value":"9783642337574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33757-4_9","type":"book-chapter","created":{"date-parts":[[2012,8,24]],"date-time":"2012-08-24T10:01:36Z","timestamp":1345802496000},"page":"111-124","source":"Crossref","is-referenced-by-count":13,"title":["Computing Longest Common Subsequences with the B-Cell Algorithm"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Christine","family":"Zarges","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heurisitcs. World Scientific (2011)","DOI":"10.1142\/7438"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Burnet, F.M.: The Clonal Selection Theory of Acquired Immunity. Cambridge University Press (1959)","DOI":"10.5962\/bhl.title.8281"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"de\u00a0Castro, L., Timmis, J.: An artificial immune network for multimodal function optimization. In: Proc. of the 4th Congress on Evolutionary Computation (CEC 2002), pp. 699\u2013704. IEEE Press (2002)","DOI":"10.1109\/CEC.2002.1007011"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TEVC.2002.1011539","volume":"6","author":"L. Castro de","year":"2002","unstructured":"de Castro, L., Zuben, F.: Learning and optimization using the clonal selection principle. IEEE Transactions on Evolutionary Computation\u00a06(3), 239\u2013251 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11536444_24","volume-title":"Artificial Immune Systems","author":"E. Clark","year":"2005","unstructured":"Clark, E., Hone, A., Timmis, J.: A Markov Chain Model of the B-Cell Algorithm. In: Jacob, C., Pilat, M.L., Bentley, P.J., Timmis, J.I. (eds.) ICARIS 2005. LNCS, vol.\u00a03627, pp. 318\u2013330. Springer, Heidelberg (2005)"},{"key":"9_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press (2001)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-45105-6_22","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"N.C. Cort\u00e9s","year":"2003","unstructured":"Cort\u00e9s, N.C., Coello Coello, C.A.: Multiobjective Optimization Using Ideas from the Clonal Selection Principle. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02723, pp. 158\u2013170. Springer, Heidelberg (2003)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-30220-9_22","volume-title":"Artificial Immune Systems","author":"V. Cutello","year":"2004","unstructured":"Cutello, V., Nicosia, G., Pavone, M.: Exploring the Capability of Immune Algorithms: A Characterization of Hypermutation Operators. In: Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds.) ICARIS 2004. LNCS, vol.\u00a03239, pp. 263\u2013276. Springer, Heidelberg (2004)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Dasgupta, D., Ni\u00f1o, F.: Immunological Computation: Theory and Applications. Auerbach (2008)","DOI":"10.1201\/9781420065466"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"De Jong, K.A.: Evolutionary Computation. A Unified Approach. MIT Press (2006)","DOI":"10.1145\/1274000.1274109"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science\u00a0276, 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Hinkemeyer, B., Julstrom, B.A.: A genetic algorithm for the longest common subsequence problem. In: Proc. of the 8th Annual Genetic and Evolutionary Computation Conf. (GECCO 2006), pp. 609\u2013610. ACM Press (2006)","DOI":"10.1145\/1143997.1144105"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Jansen, T.: Simulated annealing. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 171\u2013196. World Scientific (2011)","DOI":"10.1142\/9789814282673_0006"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T. Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation\u00a013(4), 413\u2013440 (2005)","journal-title":"Evolutionary Computation"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-22371-6_13","volume-title":"Artificial Immune Systems","author":"T. Jansen","year":"2011","unstructured":"Jansen, T., Oliveto, P.S., Zarges, C.: On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem. In: Li\u00f2, P., Nicosia, G., Stibor, T. (eds.) ICARIS 2011. LNCS, vol.\u00a06825, pp. 117\u2013131. Springer, Heidelberg (2011)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T. Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: On the analysis of evolutionary algorithms \u2014 a proof that crossover really can help. Algorithmica\u00a034(1), 47\u201366 (2002)","journal-title":"Algorithmica"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s00453-008-9243-6","volume":"57","author":"T. Jansen","year":"2010","unstructured":"Jansen, T., Weyland, D.: Analysis of evolutionary algorithms for the longest common subsequence problem. Algorithmica\u00a057, 170\u2013186 (2010)","journal-title":"Algorithmica"},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.tcs.2010.09.027","volume":"412","author":"T. Jansen","year":"2011","unstructured":"Jansen, T., Zarges, C.: Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoretical Computer Science\u00a0412(6), 517\u2013533 (2011)","journal-title":"Theoretical Computer Science"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/11844297_94","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"B.A. Julstrom","year":"2006","unstructured":"Julstrom, B.A., Hinkemeyer, B.: Starting from Scratch: Growing Longest Common Subsequences with Evolution. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol.\u00a04193, pp. 930\u2013938. Springer, Heidelberg (2006)"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45105-6_26","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"J. Kelsey","year":"2003","unstructured":"Kelsey, J., Timmis, J.: Immune Inspired Somatic Contiguous Hypermutation for Function Optimisation. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02723, pp. 207\u2013218. Springer, Heidelberg (2003)"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM\u00a025(2), 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.cor.2011.02.026","volume":"39","author":"S.R. Mousavi","year":"2012","unstructured":"Mousavi, S.R., Tabataba, F.: An improved algorithm for the longest common subsequence problem. Computers & Operations Research\u00a039, 512\u2013520 (2012)","journal-title":"Computers & Operations Research"},{"key":"9_CR25","unstructured":"Murphy, K., Travers, P., Walport, M.: Janeway\u2019s Immunobiology, 8th edn., Oxford (2011)"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.compbiolchem.2011.12.004","volume":"36","author":"F.S. Tabataba","year":"2012","unstructured":"Tabataba, F.S., Mousavi, S.R.: A hyper-heuristic for the longest common subsequence problem. Computational Biology and Chemistry\u00a036, 42\u201354 (2012)","journal-title":"Computational Biology and Chemistry"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Wang, Q., Pan, M., Shang, Y., Korkin, D.: A fast heuristic search algorithm for finding the longest common subsequence of multiple strings. In: Proc. of the Twenty-Fourth AAAI Conf. on Artificial Intelligence, AAAI 2010 (2010)","DOI":"10.1609\/aaai.v24i1.7493"},{"issue":"1","key":"9_CR28","first-page":"65","volume":"14","author":"C. Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the (\u03bc+1) EA on simple pseudo-boolean functions. Evolutionary Computation\u00a014(1), 65\u201386 (2006)","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Artificial Immune Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33757-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T05:51:25Z","timestamp":1744005085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33757-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337567","9783642337574"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33757-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}