An information-theoretic lower bound for the longest common subsequence problem
type: Item
instance of: scholarly article
title: An information-theoretic lower bound for the longest common subsequence problem
zbMATH Open document ID: 0365.94025
DOI: 10.1016/0020-0190(78)90037-6
published in: Information Processing Letters
publication date: 1978-01-01T00:00:00Z
full work available at URL: http://hdl.handle.net/1911/19954
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3570320
author: Daniel S. Hirschberg
MaRDI profile type: Publication
OpenAlex ID: W2093513138
cites work: Bounds on the Complexity of the Longest Common Subsequence Problem
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: A fast algorithm for computing longest common subsequences
description: scientific article; zbMATH DE number 3570320