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:	Artículo
Lenguaje:	English
Materias:	Parallel algorithms. Parallel architectures. Linear systolic arrays. VLSI. Longest common subsequence problem.