The set LCS problem

DOI10.1007/BF01840351zbMath0642.68065OpenAlexW2005560767MaRDI QIDQ1101215

Lawrence L. Larmore, Daniel S. Hirschberg

Publication date: 1987

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programminglongest common subsequence

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ The set-set LCS problem

Cites Work

• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences

This page was built for publication: The set LCS problem