A linear space algorithm for the LCS problem

DOI10.1007/BF00265993zbMath0642.68066OpenAlexW10539125MaRDI QIDQ1101217

S. Kiran Kumar, C. Pandu Rangan

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00265993

zbMATH Keywords

longest common subsequencelinear space algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (8)

DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM ⋮ Longest common subsequences ⋮ Efficient merged longest common subsequence algorithms for similar sequences ⋮ Fast linear-space computations of longest common subsequences ⋮ Unnamed Item ⋮ An algorithm for distinguishing efficiently bit-strings by their subsequences ⋮ Simple and fast linear space computation of longest common subsequences ⋮ APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †

This page was built for publication: A linear space algorithm for the LCS problem