Fast linear-space computations of longest common subsequences

DOI10.1016/0304-3975(92)90132-YzbMath0747.68019MaRDI QIDQ1190449

S. Singh

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

longest common subsequence

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W10: Parallel algorithms in computer science

Related Items

Fast linear-space computations of longest common subsequences, Simple and fast linear space computation of longest common subsequences, APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †

Cites Work

• Unnamed Item
• Unnamed Item
• Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
• The longest common subsequence problem revisited
• An \(O(ND)\) difference algorithm and its variations
• A linear space algorithm for the LCS problem
• A faster algorithm computing string edit distances
• A longest common subsequence algorithm suitable for similar text strings
• Fast linear-space computations of longest common subsequences
• A linear space algorithm for computing maximal common subsequences
• 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
• The String-to-String Correction Problem
• A representation for linear lists with movable fingers