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

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

Bibliografiske detaljer
Udgivet i:Information processing letters. 61, 3 (1997).
Hovedforfatter: Lecroq, Thierry
Format: Article
Sprog:English
Fag:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.