Repetition-free longest common subsequence (Q5901069): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exemplar Longest Common Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457092 / 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: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank

Latest revision as of 02:46, 3 July 2024

scientific article; zbMATH DE number 5770506
Language Label Description Also known as
English
Repetition-free longest common subsequence
scientific article; zbMATH DE number 5770506

    Statements

    Repetition-free longest common subsequence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2010
    0 references
    0 references
    longest common subsequence
    0 references
    APX-hardness
    0 references
    approximation algorithms
    0 references
    0 references