An efficient systolic algorithm for the longest common subsequence problem
From MaRDI portal
Publication:1275339
DOI10.1023/A:1008087824437zbMath0912.68080OpenAlexW1545046733MaRDI QIDQ1275339
Publication date: 17 January 1999
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008087824437
Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Related Items (1)
This page was built for publication: An efficient systolic algorithm for the longest common subsequence problem