Simple and fast linear space computation of longest common subsequences

DOI10.1016/S0020-0190(00)00114-9MaRDI QIDQ1583368zbMATH OpenFDO

Authors Claus Rick

Publication date 26 October 2000

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

Full work available at URL https://doi.org/10.1016/S0020-0190(00)00114-9

zbMATH Keywords

linear spacelongest common subsequence

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• A linear space algorithm for computing maximal common subsequences
• A linear space algorithm for the LCS problem
• Algorithms for the Longest Common Subsequence Problem
• An \(O(ND)\) difference algorithm and its variations
• An O(NP) sequence comparison algorithm
• Fast linear-space computations of longest common subsequences
• scientific article; zbMATH DE number 1044854 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 842125 (Why is no real title available?)

Cited in

(6)

• Efficient merged longest common subsequence algorithms for similar sequences
• Fast Algorithms for Computing Tree LCS
• The longest common subsequence problem for small alphabets in the word RAM model
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583368)