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
التنسيق: مقال
اللغة:English
الموضوعات:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.