Randomized fixed-parameter algorithms for the closest string problem (Q261382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Lusheng Wang / 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.1007/s00453-014-9952-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993117718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closest string and substring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved parameterized set splitting algorithms: A Probabilistic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934608 / 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: Space and Time Efficient Algorithms for Planted Motif Search / 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: Fundamentals of Computation Theory / 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: Random Methods for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering problems of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / 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: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing string selection problems. / 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: Closest Substring Problems with Small Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of multicut parameterized by the size of the cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solutions for the Closest-String Problem via Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of the Centre and Median String Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the 1-mismatch problem / 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 15:44, 11 July 2024

scientific article
Language Label Description Also known as
English
Randomized fixed-parameter algorithms for the closest string problem
scientific article

    Statements

    Randomized fixed-parameter algorithms for the closest string problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 March 2016
    0 references
    closest string problem
    0 references
    fixed-parameter algorithms
    0 references
    randomized algorithms
    0 references
    computational biology
    0 references

    Identifiers