A faster linear systolic algorithm for recovering a longest common subsequence

DOI10.1016/S0020-0190(97)00011-2zbMath1337.68308OpenAlexW2080063304MaRDI QIDQ290200

Guillaume Luce, Thierry Lecroq, 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 algorithmsVLSIlinear systolic arrayslongest common subsequence problemparallel architectures

Mathematics Subject Classification ID

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

Related Items (1)

DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

Cites Work

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

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