A faster linear systolic algorithm for recovering a longest common subsequence.

A faster linear systolic algorithm for recovering a longest common subsequence.

מידע ביבליוגרפי
הוצא לאור ב:Information processing letters. 61, 3 (1997).
מחבר ראשי: Lecroq, Thierry
פורמט: Article
שפה:English
נושאים:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.