A three-string approach to the closest string problem (Q414864): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2011.01.003 / 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.jcss.2011.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032287082 / 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: Q4393480 / 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: 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: On the closest string and substring 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2011.01.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:50, 9 December 2024

scientific article
Language Label Description Also known as
English
A three-string approach to the closest string problem
scientific article

    Statements

    A three-string approach to the closest string problem (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    computational biology
    0 references
    the closest string problem
    0 references
    fixed-parameter algorithms
    0 references

    Identifiers