The parameterized complexity of the shared center problem

DOI10.1007/s00453-012-9730-7zbMath1358.68124OpenAlexW2008154175MaRDI QIDQ517791

Wenji Ma, Zhi-Zhong Chen, Lusheng Wang

Publication date: 27 March 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9730-7

zbMATH Keywords

pedigreeparameterized algorithmsparameterized complexitylinkage analysishaplotype inferenceallele-sharing status

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10)

Related Items (1)

A polynomial time approximation scheme for the closest shared center problem

Cites Work

• A three-string approach to the closest string problem
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Parametrized complexity theory.
• Closest Substring Problems with Small Distances
• More Efficient Algorithms for Closest String and Substring Problems
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: The parameterized complexity of the shared center problem