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

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters. 61, 3 (1997).
1. Verfasser:	Lecroq, Thierry
Format:	Artikel
Sprache:	English
Schlagworte:	Parallel algorithms. Parallel architectures. Linear systolic arrays. VLSI. Longest common subsequence problem.