A polynomial time approximation scheme for the closest shared center problem

Abstract

Mutation region detection is the first step of searching for a disease gene and has facilitated the identification of several hundred human genes that can harbor mutations leading to a disease phenotype. Recently, the closest shared center problem (CSC) was proposed as a core to solve the mutation region detection problem when the pedigree is not given [9]. A ratio-2 approximation algorithm was proposed for the closest shared center problem. In this paper, we will design a polynomial time approximation scheme for this problem. © 2013 Springer-Verlag Berlin Heidelberg.