Application-specific array processors for the longest common subsequence problem of three sequences.

We design linear time systolic-based parallel algorithms that run on two-dimensional arrays for both computing the length and recovering a longest common subsequence of three given sequences that are appropriate for very large-scale integration (VLSI) implementation. These problems have been qualifi...

詳細記述

書誌詳細

出版年:	Parallel algorithms and applications. 13, 1 (1998).
第一著者:	Luce, Guillaume
フォーマット:	論文
言語:	English
主題:	Systolic-based parallel architectures and algorithms. VLSI systems. Special purpose processors. Longest common subsequence problem of three strings. Dynamic programming.