Probabilistic Beam Search for the Longest Common Subsequence Problem
- 605 Downloads
Finding the common part of a set of strings has many important applications, for example, in pattern recognition or computational biology. In computer science, this problem is known as the longest common subsequence problem. In this work we present a probabilistic beam search approach to solve this classical problem. To our knowledge, this algorithm is the first stochastic local search algorithm proposed for this problem. The results show the great potential of our algorithm when compared to existing heuristic methods.
Unable to display preview. Download preview PDF.
- 7.Blum, C., Cotta, C., Fernández, 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 – Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation. LNCS, vol. 4446, Springer, Heidelberg (In press, 2007)Google Scholar
- 8.Fraser, C.B.: Subsequences and supersequences of strings. PhD thesis, University of Glasgow (1995)Google Scholar
- 9.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–1011. IEEE press, Los Alamitos (2004)Google Scholar