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

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

Podrobná bibliografie
Vydáno v:Information processing letters. 61, 3 (1997).
Hlavní autor: Lecroq, Thierry
Médium: Článek
Jazyk:English
Témata:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.