Fast Sequence Similarity Computing with LCS on LARPBS
The problem of the longest common subsequence (LCS) is a fundamental problem in sequence alignment. In this paper, we first present fast parallel algorithms for sequence similarity with LCS. For two sequences of lengths m and n (m ≤ n), the algorithm uses n processors and costs O(m) computation time. Time-area cost of the algorithm is O(mn) which reaches optimality. Based on this algorithm, we also give a fast parallel algorithm which can compute the length of LCS in O(logm) time. To our best knowledge, this is the fastest one among the parallel LCS algorithms on array architectures.
KeywordsParallel Algorithm Systolic Array Longe Common Subsequence Longe Common Subsequence Primitive Operation
Unable to display preview. Download preview PDF.
- 3.Aggarwal, A., Park, J.: Notes on Searching in Multidimensional Monotone Arrays. In: Proc. 29th Ann. IEEE Symp. Foundations of Comput. Sci., pp. 497–512 (1988)Google Scholar
- 5.Chang, J.H., Ibarra, O.H., Pallis, M.A.: Parallel Parsing on a one-way array of finite-state machines. IEEE Trans. Computers C-36, 64–75 (1987)Google Scholar
- 9.Li, K., Pan, Y., Zheng, S.-Q. (eds.): Parallel Computing Using Optical Interconnections. Kluwer Academic Publishers, Boston (1998), ISBN 0-7923-8296-XGoogle Scholar