Systolic-based parallel architecture for the longest common subsequences problem

DOI10.1016/S0167-9260(98)00003-0MaRDI QIDQ4224389zbMATH OpenOpenAlexFDO

Authors Guillaume Luce, Jean Frédéric Myoupo

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 tolerancelongest common subsequencesmodularitysystolic algorithms

Mathematics Subject Classification ID

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

Recommendations

• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• A systolic array for the longest common subsequence problem
• An efficient systolic algorithm for the longest common subsequence problem
• Time-efficient parallel algorithms for the longest common subsequence and related problems
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
• scientific article; zbMATH DE number 278833
• scientific article; zbMATH DE number 88968
• scientific article; zbMATH DE number 3984568

Cited in

(5)

• A faster linear systolic algorithm for recovering a longest common subsequence
• scientific article; zbMATH DE number 3900156 (Why is no real title available?)
• scientific article; zbMATH DE number 3984568 (Why is no real title available?)
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

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

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