Parameterized complexity analysis for the closest string with wildcards problem (Q495996): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6482878 / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
closest string problem
Property / zbMATH Keywords: closest string problem / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter algorithms
Property / zbMATH Keywords: fixed-parameter algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
computational biology
Property / zbMATH Keywords: computational biology / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HapCUT / 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.2015.06.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180648128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and APX-hard cases of the individual haplotyping problem / 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: A Closer Look at the Closest String and Closest Substring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / 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: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering problems of codes / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / 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: A dynamic programming algorithm for the \(k\)-haplotyping problem / 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: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408101 / 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 / cites work
 
Property / cites work: An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haplotype assembly from aligned weighted SNP fragments / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:25, 10 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity analysis for the closest string with wildcards problem
scientific article

    Statements

    Parameterized complexity analysis for the closest string with wildcards problem (English)
    0 references
    0 references
    0 references
    16 September 2015
    0 references
    parameterized complexity
    0 references
    closest string problem
    0 references
    fixed-parameter algorithms
    0 references
    computational biology
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers