Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima

DOI10.1080/10556789808805713zbMath0947.90121OpenAlexW2001976285MaRDI QIDQ4946707

Koji Hakata, Hiroshi Imai

Publication date: 8 November 2000

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805713

zbMATH Keywords

dynamic programmingcomputational geometrylongest common subsequencegeometric maxima

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (2)

On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems ⋮ Maxima-finding algorithms for multidimensional samples: A two-phase approach

This page was built for publication: Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima