SCOPUS 정보 검색 플랫폼

Volumn 61, Issue 3, 1997, Pages 129-136

A faster linear systolic algorithm for recovering a longest common subsequence

Author keywords

Linear systolic arrays; Longest common subsequence problem; Parallel algorithms; Parallel architectures; VLSI

Indexed keywords

EID: 0009786612 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/s0020-0190(97)00011-2 Document Type: Article

Times cited : (13)

References (11)

1
- 0025508207
- Efficient parallel algorithms for string editing and related problems
- A. Apostolico, M. Attalah, L. Larmore and S. Mcfaddin, Efficient parallel algorithms for string editing and related problems, SIAM J. Comput. 19 (1990) 968-988.
- (1990) SIAM J. Comput. , vol.19 , pp. 968-988
- Apostolico, A.¹ Attalah, M.² Larmore, L.³ Mcfaddin, S.⁴

2
- 0023596495
- Immediate parallel solution of the longest common subsequence problem
- D.M. Champion and J. Rothstein, Immediate parallel solution of the longest common subsequence problem, in: Proc. ICPP (1987) 70-77.
- (1987) Proc. ICPP , pp. 70-77
- Champion, D.M.¹ Rothstein, J.²

3
- 84990718711
- Longest common subsequences
- V. Dančík and M.S. Paterson, Longest common subsequences, in: Proc. Ann. Symp. Theor. Aspects Comput. Sci. (1994) 127-142.
- (1994) Proc. Ann. Symp. Theor. Aspects Comput. Sci. , pp. 127-142
- Dančík, V.¹ Paterson, M.S.²

4
- 0016518550
- A linear space algorithm for computing maximal common subsequences
- D.S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Comm. ACM 18 (6) (1975) 341-343.
- (1975) Comm. ACM , vol.18 , Issue.6 , pp. 341-343
- Hirschberg, D.S.¹

5
- 0019923189
- Why systolic architectures?
- H.T. Kung, Why systolic architectures?, IEEE Comput. 15 (1) (1980) 37-46.
- (1980) IEEE Comput. , vol.15 , Issue.1 , pp. 37-46
- Kung, H.T.¹

6
- 0028497665
- New systolic arrays for the longest common subsequence problem
- Y.C. Lin, New systolic arrays for the longest common subsequence problem, Parallel Comput. 20 (1994) 1323-1334.
- (1994) Parallel Comput. , vol.20 , pp. 1323-1334
- Lin, Y.C.¹

7
- 0028483609
- Parallel algorithms for the longest common subsequence problem
- M. Lu and H. Lin, Parallel algorithms for the longest common subsequence problem, IEEE Trans. Parallel Distributed Systems 5 (8) (1994) 835-848.
- (1994) IEEE Trans. Parallel Distributed Systems , vol.5 , Issue.8 , pp. 835-848
- Lu, M.¹ Lin, H.²

9
- 0018985316
- A faster algorithm for computing string edit distances
- W.J. Masek and M.S. Paterson, A faster algorithm for computing string edit distances, J. Comput. System Sci. 20 (1980) 18-31.
- (1980) J. Comput. System Sci. , vol.20 , pp. 18-31
- Masek, W.J.¹ Paterson, M.S.²

10
- 0022420736
- A systolic array for the longest common subsequence problem
- Y. Robert and M. Tchuente, A systolic array for the longest common subsequence problem, Inform. Process. Lett. 21 (1985) 191-198.
- (1985) Inform. Process. Lett. , vol.21 , pp. 191-198
- Robert, Y.¹ Tchuente, M.²

11
- 33749147315
- A broadcast/reduce architecture for high-speed data compression
- R.J. Zito-Wolf, A broadcast/reduce architecture for high-speed data compression, in: Proc. IEEE Symp. Parall. Distrib. Process., 1990.
- (1990) Proc. IEEE Symp. Parall. Distrib. Process.
- Zito-Wolf, R.J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.