Polynomial-time equivalences and refined algorithms for longest common subsequence variants

DOI10.4230/LIPICS.CPM.2022.15MaRDI QIDQ6496843zbMATH OpenFDO

Authors Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Publication date 6 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2022.15

zbMATH Keywords

approximation algorithmsexact algorithmsmultiset restricted longest common subsequence problemone-side-filled longest common subsequence problemrepetition-bounded longest common subsequence problemtwo-side-filled longest common subsequence problem

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(1)

• Polynomial-time equivalences and refined algorithms for longest common subsequence variants

This page was built for publication: Polynomial-time equivalences and refined algorithms for longest common subsequence variants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496843)