On solving a generalized constrained longest common subsequence problem

DOI10.1007/978-3-030-62867-3_5MaRDI QIDQ2679772zbMATH OpenOpenAlexFDO

Authors Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum

Publication date 25 January 2023

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

zbMATH Keywords

\(A^*\) searchbeam searchconstrained subsequenceslongest common subsequences

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Recommendations

• On the generalized constrained longest common subsequence problems
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
• The constrained longest common subsequence problem
• Constrained LCS: Hardness and Approximation
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS

Cited in

(11)

• An improved algorithm for the longest common subsequence problem
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
• scientific article; zbMATH DE number 6697960 (Why is no real title available?)
• The Constrained Longest Common Subsequence Problem for Degenerate Strings
• The constrained shortest common supersequence problem
• Variants of constrained longest common subsequence
• A hyper-heuristic for the longest common subsequence problem
• Probabilistic Beam Search for the Longest Common Subsequence Problem
• Beam search for the longest common subsequence problem
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization

This page was built for publication: On solving a generalized constrained longest common subsequence problem

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