The set-set LCS problem

DOI10.1007/BF01553904zbMath0684.68080OpenAlexW2025204946MaRDI QIDQ1825675

Lawrence L. Larmore, Daniel S. Hirschberg

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programminglongest common subsequence problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Dynamic programming (90C39)

Related Items (2)

Unnamed Item ⋮ Matching for run-length encoded strings

Cites Work

• An \(O(ND)\) difference algorithm and its variations
• The set LCS problem
• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences

This page was built for publication: The set-set LCS problem