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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abecasis, G., Cherny, S., Cookson, W., Cardon, L.: Merlin-rapid analysis of dense genetic maps using sparse gene flow trees. Nature Genetics 30, 97–101 (2002)
Cai, Z., Sabaa, H., Wang, Y., Goebel, R., Wang, Z., Xu, J., Stothard, P., Lin, G.: Most parsimonious haplotype allele sharing determination. BMC Bioinformatics 10, 115 (2009)
Gillman, D.: A Chernoff bound for randomwalks on expanders. In: Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pp. 680–691 (1993)
Gudbjartsson, D.F., Jonasson, K., Frigge, M.L., Kong, A.: Allegro, a new computer program for multipoint linkage analysis. Nature Genetics 25, 12–13 (2000)
Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)
Kruglyak, L., Daly, M.J., Reeve-Daly, M.P., Lander, E.S.: Parametric and nonparametric linkage analysis: a unified multipoint approach. American Journal of Human Genetics 58, 1347–1363 (1995)
Li, M., Ma, B., Wang, L.: On the closest string and substring problems. J. Assoc. Comput. Mach. 49, 157–171 (2002)
Lin, G., Wang, Z., Wang, L., Lau, Y.-L., Yang, W.: Identification of linked regions using high-density SNP genotype data in linkage analysis. Bioinformatics 24(1), 86–93 (2008)
Ma, W., Yang, Y., Chen, Z., Wang, L.: Mutation region detection for closely related individuals without a known pedigree using high-density genotype data. IEEE/ACM Transactions on Computational Biology and Bioinformatics 9(2), 372–384 (2012)
Cui, W., Wang, L.: Identifying mutation regions for closely related individuals without a known pedigree. BMC Bioinformatics 13, 146 (2012)
Chen, Z.-Z., Ma, W., Wang, L.: The Parameterized Complexity of the Shared Center Problem, Algorithmic (to appear)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Univ. Press (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, W., Wang, L., Cui, W. (2013). A Polynomial Time Approximation Scheme for the Closest Shared Center Problem. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-38768-5_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38767-8
Online ISBN: 978-3-642-38768-5
eBook Packages: Computer ScienceComputer Science (R0)