On the use of decision diagrams for finding repetition-free longest common subsequences

DOI10.1007/978-3-030-62867-3_11MaRDI QIDQ2679779zbMATH OpenOpenAlexFDO

Authors Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl

Publication date 25 January 2023

Full work available at URL https://doi.org/10.1007/978-3-030-62867-3_11

zbMATH Keywords

maximum independent setdecision diagramrepetition-free longest common subsequence

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Recommendations

• Better heuristic algorithms for the repetition free LCS and other variants
• A branch-and-cut approach to the repetition-free longest common subsequence problem
• Exact algorithms for the repetition-bounded longest common subsequence problem
• On the parameterized complexity of the repetition free longest common subsequence problem
• Exact algorithms for the bounded repetition longest common subsequence problem

Cited in

(1)

• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem

This page was built for publication: On the use of decision diagrams for finding repetition-free longest common subsequences

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