Recently, the shared center (SC) problem has been proposed as a mathematical model for inferring the allele-sharing status of a given set of individuals using a database of confirmed haplotypes as reference. The problem was proved to be NP-complete and a ratio-2 polynomial-time approximation algorithm was designed for its minimization version (called the closest shared center (CSC) problem). In this paper, we consider the parameterized complexity of the SC problem. First, we show that the SC problem is W[1]-hard with parameters d and n, where d and n are the radius and the number of (diseased or normal) individuals in the input, respectively. Then, we present two asymptotically optimal parameterized algorithms for the problem. © 2012 Springer-Verlag.
CITATION STYLE
Chen, Z. Z., Wang, L., & Ma, W. (2012). The parameterized complexity of the shared center problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7354 LNCS, pp. 439–452). https://doi.org/10.1007/978-3-642-31265-6_35
Mendeley helps you to discover research relevant for your work.