Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new efficient algorithm for computing the longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the repetition free 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: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / 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: Repetition-free longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized constrained longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of constrained longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel evolutionary models and applications to sequence alignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the repetition free longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem for arc-annotated sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching for arc-annotated sequences / 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: A hardness result and new algorithm for the longest common palindromic subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Optimization with Decision Diagrams / rank
 
Normal rank

Latest revision as of 00:38, 25 July 2024

scientific article
Language Label Description Also known as
English
Solving longest common subsequence problems via a transformation to the maximum clique problem
scientific article

    Statements

    Solving longest common subsequence problems via a transformation to the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 April 2021
    0 references
    longest common subsequence
    0 references
    transformation to maximum clique
    0 references
    exact and heuristic solvers
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references