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

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

Opis bibliograficzny
Wydane w:Information processing letters. 61, 3 (1997).
1. autor: Lecroq, Thierry
Format: Artykuł
Język:English
Hasła przedmiotowe:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.