A linear space algorithm for the LCS problem
type: Item
instance of: scholarly article
title: A linear space algorithm for the LCS problem
zbMATH Open document ID: 0642.68066
DOI: 10.1007/BF00265993
author: S. Kiran Kumar
author: C. Pandu Rangan
published in: Acta Informatica
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 4047095
zbMATH Keywords: longest common subsequence
zbMATH Keywords: linear space algorithm
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf00265993
OpenAlex ID: W10539125
Recommended article: New algorithms for the LCS problem
Recommended article: An entire space polynomial-time algorithm for linear programming
Recommended article: New efficient algorithms for the LCS and constrained LCS problems
Recommended article: An almost-linear time and linear space algorithm for the longest common subsequence problem
Recommended article: Q3143773
Recommended article: A dynamic programming solution to a generalized LCS problem
Recommended article: An efficient algorithm for LCS problem between two arbitrary sequences
Recommended article: Q3813592
Recommended article: Q3512800
Recommended article: A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
description: scientific article; zbMATH DE number 4047095