A systolic array for the longest common subsequence problem
From MaRDI portal
Publication:1066678
DOI10.1016/0020-0190(85)90058-4zbMath0578.68066OpenAlexW2004333039MaRDI QIDQ1066678
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90058-4
Related Items (5)
A faster linear systolic algorithm for recovering a longest common subsequence ⋮ DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM ⋮ Catastrophic faults in reconfigurable systolic linear arrays ⋮ Computational geometry algorithms for the systolic screen ⋮ APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
Cites Work
- Unnamed Item
- On a family of L languages resulting from systolic tree automata
- A longest common subsequence algorithm suitable for similar text strings
- Systolic trees and systolic language recognition by tree automata
- An information-theoretic lower bound for the longest common subsequence problem
- Résolution systolique de systèmes linéaires denses
- Bounds on the Complexity of the Longest Common Subsequence Problem
- A fast algorithm for computing longest common subsequences
- Algorithms for the Longest Common Subsequence Problem
This page was built for publication: A systolic array for the longest common subsequence problem