A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3172429850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Optimization with Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Bounds from Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision diagrams for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Beam Search for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam search for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving longest common subsequence problems via a transformation to the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivalued Decision Diagrams for Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large neighborhood search heuristic for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid optimization methods for time-dependent sequencing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the longest common subsequence for multiple biological sequences by ant colony optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:07, 28 July 2024

scientific article
Language Label Description Also known as
English
A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
scientific article

    Statements

    A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (English)
    0 references
    0 references
    0 references
    21 March 2022
    0 references
    longest common subsequence problem
    0 references
    multi-valued decision diagram
    0 references
    A\textsuperscript{*} search
    0 references

    Identifiers