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

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

ग्रंथसूची विवरण
में प्रकाशित:Information processing letters. 61, 3 (1997).
मुख्य लेखक: Lecroq, Thierry
स्वरूप: लेख
भाषा:English
विषय:
Parallel algorithms.
Parallel architectures.
Linear systolic arrays.
VLSI.
Longest common subsequence problem.