Simple and fast linear space computation of longest common subsequences

DOI10.1016/S0020-0190(00)00114-9zbMath0953.68638MaRDI QIDQ1583368

Claus Rick

Publication date: 26 October 2000

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

zbMATH Keywords

linear spacelongest common subsequence

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (5)

Efficient merged longest common subsequence algorithms for similar sequences ⋮ Fast Algorithms for Computing Tree LCS ⋮ Efficient algorithms for the block edit problems ⋮ A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings ⋮ Fast algorithms for computing tree LCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(NP) sequence comparison algorithm
• An \(O(ND)\) difference algorithm and its variations
• A linear space algorithm for the LCS problem
• Fast linear-space computations of longest common subsequences
• A linear space algorithm for computing maximal common subsequences
• Algorithms for the Longest Common Subsequence Problem

This page was built for publication: Simple and fast linear space computation of longest common subsequences