Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Corrigendum to: ``Parameterized tractability of the maximum-duo preservation string mapping problem''. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized tractability of the maximum-duo preservation string mapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant Sums for Undirected Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow sieves for parameterized paths and packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 7/2-approximation algorithm for the Maximum Duo-Preservation String Mapping Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation for the Maximum Duo-Preservation String Mapping Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further improvement in approximating the maximum duo-preservation string mapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum duo-preservation string mapping problem with linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string edit distance matching problem with moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic remark on algebraic program testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5110874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum common string partition problem: hardness and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum common string partition revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative families: a unified tradeoff-based approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the true evolutionary distance between two genomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 23:39, 23 July 2024

scientific article
Language Label Description Also known as
English
Revisiting the parameterized complexity of maximum-duo preservation string mapping
scientific article

    Statements

    Revisiting the parameterized complexity of maximum-duo preservation string mapping (English)
    0 references
    6 November 2020
    0 references
    maximum-duo preservation string mapping
    0 references
    parameterized algorithms
    0 references
    kernelization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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