Systolic-based parallel architecture for the longest common subsequences problem

DOI10.1016/S0167-9260(98)00003-0zbMath0908.68070OpenAlexW2038707433MaRDI QIDQ4224389

Jean-Frédéric Myoupo, Guillaume Luce

Publication date: 12 January 1999

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9260(98)00003-0

zbMATH Keywords

dynamic programmingfault tolerancesystolic algorithmsmodularitylongest common subsequences

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computer system organization (68M99)

This page was built for publication: Systolic-based parallel architecture for the longest common subsequences problem