Simple and fast linear space computation of longest common subsequences
type: Item
instance of: scholarly article
title: Simple and fast linear space computation of longest common subsequences
zbMATH Open document ID: 0953.68638
DOI: 10.1016/S0020-0190(00)00114-9
author: Claus Rick
published in: Information Processing Letters
publication date: 2000-10-26T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 1521803
zbMATH Keywords: longest common subsequence
zbMATH Keywords: linear space
MaRDI profile type: Publication
cites work: Q4714446
cites work: Fast linear-space computations of longest common subsequences
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: Q4347080
cites work: A linear space algorithm for the LCS problem
cites work: An \(O(ND)\) difference algorithm and its variations
cites work: Q4862293
cites work: An O(NP) sequence comparison algorithm
description: scientific article; zbMATH DE number 1521803