Q5140766 (Q5140766): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for bipartite matching with metric and geometric costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming strategies for solving the minimum common string partition problem / 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: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / 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: Linear-Time Approximation for Maximum Weight Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5110874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick greedy computation for minimum common string partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum common string partition revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for edit distance with moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating reversal distance for strings with bounded number of duplicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5110875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating weighted duo-preservation in comparative genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the true evolutionary distance between two genomes / rank
 
Normal rank

Latest revision as of 05:12, 24 July 2024

scientific article; zbMATH DE number 7286731
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7286731

    Statements

    0 references
    16 December 2020
    0 references
    approximation algorithm
    0 references
    maximum duo-preservation string mapping
    0 references
    minimum common string partition
    0 references
    string comparison
    0 references
    streaming algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers