DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

DOI10.1080/10637190208941431zbMath1002.68198OpenAlexW2002271010MaRDI QIDQ4532713

Yen-Chun Lin, Jih-Wei Yeh

Publication date: 4 December 2002

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637190208941431

zbMATH Keywords

longest common subsequence

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• A faster linear systolic algorithm for recovering a longest common subsequence
• A systolic array for the longest common subsequence problem
• A linear space algorithm for the LCS problem
• A longest common subsequence algorithm suitable for similar text strings
• Fast linear-space computations of longest common subsequences
• An efficient systolic algorithm for the longest common subsequence problem
• A linear space algorithm for computing maximal common subsequences
• Bounds on the Complexity of the Longest Common Subsequence Problem
• Algorithms for the Longest Common Subsequence Problem
• Algorithms on Strings, Trees and Sequences
• The String-to-String Correction Problem