scientific article; zbMATH DE number 3900156

MaRDI QIDQ3678671zbMATH OpenFDO

Authors Yves Robert, Maurice Tchuente

Publication date 1984

zbMATH Keywords

longest common subsequencespecial-purpose parallel architecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A faster linear systolic algorithm for recovering a longest common subsequence
• An efficient systolic algorithm for the longest common subsequence problem
• Systolic-based parallel architecture for the longest common subsequences problem
• A systolic array for the longest common subsequence problem
• scientific article; zbMATH DE number 3984568

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678671)