A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
type: Item
instance of: scholarly article
title: A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
DOI: 10.1007/978-3-030-78230-6_5
author: Matthias Horn
author: Günther R. Raidl
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7493622
zbMATH Keywords: longest common subsequence problem
zbMATH Keywords: multi-valued decision diagram
zbMATH Keywords: A\textsuperscript{*} search
MaRDI profile type: Publication
full work available at URL: 978-3-030-78230-6 5
OpenAlex ID: W3172429850
cites work: Discrete optimization with decision diagrams
cites work: Optimization Bounds from Binary Decision Diagrams
cites work: Decision diagrams for optimization
cites work: Probabilistic Beam Search for the Longest Common Subsequence Problem
cites work: Beam search for the longest common subsequence problem
cites work: Solving longest common subsequence problems via a transformation to the maximum clique problem
cites work: Multivalued Decision Diagrams for Sequencing Problems
cites work: A large neighborhood search heuristic for the longest common subsequence problem
cites work: Algorithms on Strings, Trees and Sequences
cites work: \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
cites work: Hybrid optimization methods for time-dependent sequencing problems
cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Finding the longest common subsequence for multiple biological sequences by ant colony optimization
Recommended article: On the use of decision diagrams for finding repetition-free longest common subsequences
Recommended article: Algorithms for Computing Variants of the Longest Common Subsequence Problem
Recommended article: Q4862293
Recommended article: On solving a generalized constrained longest common subsequence problem
Recommended article: A local search framework for compiling relaxed decision diagrams
Recommended article: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
Recommended article: On the generalized constrained longest common subsequence problems
Recommended article: The Longest Common Subsequence Problem A Finite Automata Approach
Recommended article: On the parameterized complexity of the repetition free longest common subsequence problem
Recommended article: A branch-and-cut approach to the repetition-free longest common subsequence problem
description: scientific article; zbMATH DE number 7493622