The parameterized complexity of the shared center problem (Q517791): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A three-string approach to the closest string problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parametrized complexity 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: Q5717121 / 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: Efficient Algorithms for the Closest String and Distinguishing String Selection Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2934651 / rank | |||
Normal rank |
Revision as of 13:44, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The parameterized complexity of the shared center problem |
scientific article |
Statements
The parameterized complexity of the shared center problem (English)
0 references
27 March 2017
0 references
haplotype inference
0 references
linkage analysis
0 references
pedigree
0 references
allele-sharing status
0 references
parameterized complexity
0 references
parameterized algorithms
0 references
0 references