Beyond the longest letter-duplicated subsequence problem

DOI10.4230/LIPICS.CPM.2022.7MaRDI QIDQ6496833zbMATH OpenFDO

Authors Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou

Publication date 6 May 2024

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

zbMATH Keywords

dynamic programminglongest common subsequenceNP-completenesssegmental duplicationstandem duplications

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(1)

• The longest subsequence-duplicated subsequence and related problems

This page was built for publication: Beyond the longest letter-duplicated subsequence problem

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