A polynomial time approximation scheme for the closest shared center problem

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Li, W., Wang, L., & Cui, W. (2013). A polynomial time approximation scheme for the closest shared center problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7936 LNCS, pp. 385–396). https://doi.org/10.1007/978-3-642-38768-5_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free