Simple and fast linear space computation of longest common subsequences

DOI10.1016/S0020-0190(00)00114-9zbMATH Open0953.68638MaRDI QIDQ1583368FDOQ1583368

Authors: 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)

Cites Work

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

Cited In (5)

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

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)