On the approximation of shortest common supersequences and longest common subsequences (Q4632426): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-58201-0_68 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1903636486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common subsequences of two random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and algorithms for plan merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198904 / 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: Computing a longest common subsequence for a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical properties of finite sequences with high Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sentence-to-Sentence Clustering Procedure for Pattern Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / 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: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest common supersequence problem over binary alphabet is NP- complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efron-Stein inequality for nonsymmetric statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank

Latest revision as of 01:53, 19 July 2024

scientific article; zbMATH DE number 7048674
Language Label Description Also known as
English
On the approximation of shortest common supersequences and longest common subsequences
scientific article; zbMATH DE number 7048674

    Statements

    On the approximation of shortest common supersequences and longest common subsequences (English)
    0 references
    0 references
    0 references
    29 April 2019
    0 references
    input sequence
    0 references
    vertex cover
    0 references
    performance ratio
    0 references
    Kolmogorov complexity
    0 references
    longest common subsequence
    0 references

    Identifiers

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