Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2020.07.042 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Repetition-free longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / 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: Q4967170 / 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: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetition-free longest common subsequence of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string merging problem / 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: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spelling correction in systems programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Sequences under Deletion/Insertion Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better heuristic algorithms for the repetition free LCS and other variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO for the Repetition-Free Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2020.07.042 / rank
 
Normal rank

Latest revision as of 10:53, 17 December 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for the repetition-bounded longest common subsequence problem
scientific article

    Statements

    Exact algorithms for the repetition-bounded longest common subsequence problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 2020
    0 references
    repetition-bounded longest common subsequence problem
    0 references
    repetition-freeness
    0 references
    exponential-time exact algorithms
    0 references
    dynamic programming
    0 references
    NP-hardness
    0 references
    APX-hardness
    0 references

    Identifiers