A faster linear systolic algorithm for recovering a longest common subsequence

DOI10.1016/S0020-0190(97)00011-2MaRDI QIDQ290200zbMATHOpenAlexFDO

Authors Thierry Lecroq, Guillaume Luce, Jean Frédéric Myoupo

Publication date 1 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00011-2

zbMATH Keywords

parallel algorithmslinear systolic arrayslongest common subsequence problemparallel architecturesVLSI

Mathematics Subject Classification ID

Algorithms on strings (68W32) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• A systolic array for the longest common subsequence problem
• An efficient systolic algorithm for the longest common subsequence problem
• Systolic-based parallel architecture for the longest common subsequences problem
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
• scientific article; zbMATH DE number 3984568

Cites work

• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• A systolic array for the longest common subsequence problem
• Efficient Parallel Algorithms for String Editing and Related Problems
• Longest common subsequences

Cited in

(7)

• scientific article; zbMATH DE number 1782360 (Why is no real title available?)
• Improved linear systolic algorithms for substring statistics
• A systolic array for the longest common subsequence problem
• scientific article; zbMATH DE number 3984568 (Why is no real title available?)
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
• scientific article; zbMATH DE number 3900156 (Why is no real title available?)
• An efficient systolic algorithm for the longest common subsequence problem

This page was built for publication: A faster linear systolic algorithm for recovering a longest common subsequence

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