The longest common subsequence problem for small alphabet size between many strings
Given two or more strings (for example, DNA and amino acid sequences), the longest common subsequence (LCS) problem is to determine the longest common subsequence obtained by deleting zero or more symbols from each string. The algorithms for computing an LCS between two strings were given by many papers, but there is no efficient algorithm for computing an LCS between more than two strings. This paper proposes a method for computing efficiently the LCS between three or more strings of small alphabet size. Specifically, our algorithm computes the LCS of d(≥ 3) strings of length n on alphabet of size s in O(nsd+Dsd(log d − 3 n+logd− 2 s)) time, where D is the number of dominant matches and is much smaller than n d . Through computational experiments, we demonstrate the effectiveness of our algorithm.
KeywordsTime Complexity Maximum Problem Longe Common Subsequence Alphabet Size Longe Common Subsequence
Unable to display preview. Download preview PDF.
- Chin, F. Y. L. and C. K. Poon, A fast algorithm for computing longest common subsequences of small alphabet size, J. of Info. Proc., Vol. 13, No.4, 1990, pp. 463–469.Google Scholar
- Masek, W. J., and M. S. Paterson, A faster algorithm computing string edit distances, JCSS, 1980, pp.18–31.Google Scholar
- Preparata, F. P., and M. Shamos, Computational Geometry, Springer-Verlag, 1985.Google Scholar