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

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

Detalles Bibliográficos
Publicado en:Information processing letters. 61, 3 (1997).
Autor Principal: Lecroq, Thierry
Formato: Artigo
Idioma:English
Subjects:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.