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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: H. S. Yoon / 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: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244087 / rank
 
Normal rank
Property / zbMATH Keywords
 
string selection
Property / zbMATH Keywords: string selection / rank
 
Normal rank
Property / zbMATH Keywords
 
string algorithms
Property / zbMATH Keywords: string algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial-time approximation scheme
Property / zbMATH Keywords: polynomial-time approximation scheme / rank
 
Normal rank
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.1016/j.tcs.2013.05.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180828828 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    string selection
    0 references
    string algorithms
    0 references
    polynomial-time approximation scheme
    0 references
    0 references
    0 references
    0 references

    Identifiers