论文信息 - Parallel algorithms for the longest common subsequence problem

Parallel algorithms for the longest common subsequence problem

The longest common subsequence problem is to find a substring that is common to two given strings and is at least as long as any other such string. If m and n are the lengths of the two strings (m<2), we obtain O(log m) time parallel algorithm with mn processors and an O(log/sup 2/ n) time optimal parallel algorithm. Serial complexity on the decision tree model is /spl Theta/(mn).

Sanjeev Saxena | K. Nandan Babu | S. Saxena | K. N. Babu | Sanjeev Saxena

[1] Alfred V. Aho,et al. Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[2] M. W. Du,et al. New Algorithms for the LCS Problem , 1984, J. Comput. Syst. Sci..

[3] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[4] Mi Lu,et al. Parallel Algorithms for the Longest Common Subsequence Problem , 1994, IEEE Trans. Parallel Distributed Syst..

[5] T. Mathies. A fast parallel algorithm to determine edit distance , 1988 .

[6] Alok Aggarwal,et al. Notes on searching in multidimensional monotone arrays , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7] John E. Shelton. People's Republic of China , 1973 .

[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[9] Mikhail J. Atallah,et al. Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..

[10] Richard P. Brent,et al. The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[11] J L Modelevsky. Computer applications in applied genetic engineering. , 1984, Advances in applied microbiology.