{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:50Z","timestamp":1725490130784},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74446-7_11","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:39:15Z","timestamp":1187681955000},"page":"150-161","source":"Crossref","is-referenced-by-count":13,"title":["Probabilistic Beam Search for the Longest Common Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","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, 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"key":"11_CR2","series-title":"Computer Science and Computational Biology","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"11_CR3","volume-title":"Data structures and algorithms","author":"A. Aho","year":"1983","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: Data structures and algorithms. Addison-Wesley, Reading (1983)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147(1), 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/SPIRE.2000.878178","volume-title":"Proceedings of SPIRE 2000 \u2013 7th International Symposium on String Processing and Information Retrieval","author":"L. Bergeroth","year":"2000","unstructured":"Bergeroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings of SPIRE 2000 \u2013 7th International Symposium on String Processing and Information Retrieval, pp. 39\u201348. IEEE press, Los Alamitos (2000)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(00)00300-0","volume":"110","author":"P. Bonizzoni","year":"2001","unstructured":"Bonizzoni, P., Della Vedova, G., Mauri, G.: Experimenting an approximation algorithm for the LCS. Discrete Applied Mathematics\u00a0110, 13\u201324 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR7","unstructured":"Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E.: A probabilistic beam search algorithm for the shortest common supersequence problem. In: C.C., et al. (eds.) Proceedings of EvoCOP 2007 \u2013 Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation. LNCS, vol. 4446, Springer, Heidelberg (In press, 2007)"},{"key":"11_CR8","unstructured":"Fraser, C.B.: Subsequences and supersequences of strings. PhD thesis, University of Glasgow (1995)"},{"key":"11_CR9","first-page":"1006","volume-title":"Proceedings of the International Computer Symposium","author":"K. Huang","year":"2004","unstructured":"Huang, K., Yang, C., Tseng, K.: Fast algorithms for finding the common subsequences of multiple sequences. In: Proceedings of the International Computer Symposium, pp. 1006\u20131011. IEEE press, Los Alamitos (2004)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/00207548808947840","volume":"26","author":"P.S. Ow","year":"1988","unstructured":"Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. International Journal of Production Research\u00a026, 297\u2013307 (1988)","journal-title":"International Journal of Production Research"},{"issue":"6","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C.: Beam-ACO\u2014Hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers & Operations Research\u00a032(6), 1565\u20131591 (2005)","journal-title":"Computers & Operations Research"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74446-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:27:45Z","timestamp":1619519265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74446-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744450"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74446-7_11","relation":{},"subject":[]}}