On approximating string selection problems with outliers (Q391209): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximate Periodicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle Detection and Correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-string approach to the closest string problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Design of Drugs Without Side-Effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized intractability of motif search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some optimization problems in molecular biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solutions for the far from most string problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering problems of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized intractability of distinguishing substring selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing string selection problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding similar regions in many sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Efficient Algorithms for Closest String and Substring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closest Substring Problems with Small Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Closest String and Distinguishing String Selection Problems / rank
 
Normal rank

Latest revision as of 05:46, 7 July 2024

scientific article
Language Label Description Also known as
English
On approximating string selection problems with outliers
scientific article

    Statements

    On approximating string selection problems with outliers (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    string selection
    0 references
    string algorithms
    0 references
    polynomial-time approximation scheme
    0 references
    0 references
    0 references
    0 references
    0 references