On the Set LCS and Set-Set LCS Problems

DOI10.1006/jagm.1993.1025zbMath0797.68067OpenAlexW2078481398MaRDI QIDQ4696652

Biing-Feng Wang, Gen-Huey Chen, Kun Soo Park

Publication date: 29 June 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1025

zbMATH Keywords

dynamic programminglongest common subsequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (2)

An improved algorithm for computing the edit distance of run-length coded strings ⋮ Matching for run-length encoded strings

This page was built for publication: On the Set LCS and Set-Set LCS Problems