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

Bibliografische gegevens
Gepubliceerd in:	Information processing letters. 61, 3 (1997).
Hoofdauteur:	Lecroq, Thierry
Formaat:	Artikel
Taal:	English
Onderwerpen:	Parallel algorithms. Parallel architectures. Linear systolic arrays. VLSI. Longest common subsequence problem.