Slika na naslovnici

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

Bibliografske podrobnosti
izdano v:Information processing letters. 61, 3 (1997).
Glavni avtor: Lecroq, Thierry
Format: Article
Jezik:angleščina
Teme:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.