A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62044790, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Repetition-free longest common subsequence / 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: Variants of constrained longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for the constrained sequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769922 / 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: Q4382646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of optimization by building and using probabilistic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained longest common subsequence problem / rank
 
Normal rank

Latest revision as of 12:15, 8 July 2024

scientific article
Language Label Description Also known as
English
A hybrid genetic algorithm for the repetition free longest common subsequence problem
scientific article

    Statements

    A hybrid genetic algorithm for the repetition free longest common subsequence problem (English)
    0 references
    0 references
    0 references
    0 references
    15 May 2014
    0 references
    repetition free longest common subsequence
    0 references
    heuristics
    0 references
    genetic algorithms
    0 references
    estimation of distribution algorithms
    0 references

    Identifiers