A linear space algorithm for the LCS problem
From MaRDI portal
Publication:1101217
DOI10.1007/BF00265993zbMath0642.68066MaRDI QIDQ1101217
S. Kiran Kumar, C. Pandu Rangan
Publication date: 1987
Published in: Acta Informatica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM, An algorithm for distinguishing efficiently bit-strings by their subsequences, Fast linear-space computations of longest common subsequences, Simple and fast linear space computation of longest common subsequences, Efficient merged longest common subsequence algorithms for similar sequences, Unnamed Item, APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †