Variants of constrained longest common subsequence (Q407588): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2010.07.015 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6018494 / rank
 
Normal rank
Property / zbMATH Keywords
 
longest common subsequence
Property / zbMATH Keywords: longest common subsequence / rank
 
Normal rank
Property / zbMATH Keywords
 
constrained longest common subsequence
Property / zbMATH Keywords: constrained longest common subsequence / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter tractability
Property / zbMATH Keywords: fixed-parameter tractability / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038282261 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0912.0368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear-space computations of longest common subsequences / 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: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetition-free longest common subsequence / 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: The constrained longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE / 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: Constrained LCS: Hardness and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest common supersequence problem over binary alphabet is NP- complete / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2010.07.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:41, 9 December 2024

scientific article
Language Label Description Also known as
English
Variants of constrained longest common subsequence
scientific article

    Statements

    Variants of constrained longest common subsequence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2012
    0 references
    longest common subsequence
    0 references
    constrained longest common subsequence
    0 references
    fixed-parameter tractability
    0 references

    Identifiers