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

DOI10.1007/978-3-030-78230-6_5OpenAlexW3172429850MaRDI QIDQ2117202

Günther R. Raidl, Matthias Horn

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_5

zbMATH Keywords

longest common subsequence problemmulti-valued decision diagramA\textsuperscript{*} search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

Cites Work

• Decision diagrams for optimization
• Beam search for the longest common subsequence problem
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• A large neighborhood search heuristic for the longest common subsequence problem
• Hybrid optimization methods for time-dependent sequencing problems
• \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
• Solving longest common subsequence problems via a transformation to the maximum clique problem
• Discrete Optimization with Decision Diagrams
• Optimization Bounds from Binary Decision Diagrams
• An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
• The Complexity of Some Problems on Subsequences and Supersequences
• Algorithms on Strings, Trees and Sequences
• Multivalued Decision Diagrams for Sequencing Problems
• Probabilistic Beam Search for the Longest Common Subsequence Problem

This page was built for publication: A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem