Abstract
In this paper, we study the Radiation Hybrid Map Construction (RHMC) problem which is about reconstructing a genome from a set of gene clusters. The problem is known to be NP-complete even when all gene clusters are of size two and the corresponding problem (RHMC 2) admits efficient constant-factor approximation algorithms. In this paper, for the first time, we consider the more general case when the gene clusters can have size either two or three (RHMC 3). Let p−RHMC be a parameterized version of RHMC where the parameter is the size of solution. We present a linear kernel for p−RHMC 3 of size 22k, together with a bounded search tree algorithm, we obtain an FPT algorithm running in O(6k k + n) time. For p−RHMC 2 we present a bounded search tree algorithm which runs in O *(2.45k) time, greatly improving the previous bound using weak kernels.
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.
References
Chen, Z.-Z., Lin, G., Wang, L.: An approximation algorithm for the minimum co-path set problem. Algorithmica 60(4), 969–986 (2011)
Cheng, Y., Cai, Z., Goebel, R., Lin, G., Zhu, B.: The radiation hybrid map construction problem: recognition, hardness, and approximation algorithms (2008) (unpublished manuscript)
De Givry, S., Bouchez, M., Chabrier, P., Milan, D., Schiex, T.: Carh ta Gene: multipopulation integrated genetic and radiation hybrid mapping. Bioinformatics 21(8), 1703 (2005)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
Cox, D.R., Burmeister, M., Price, E.R., Kim, S., Myers, R.M.: Radiation hybrid mapping: a somatic cell genetic method for constructing high resolution maps of mammalian chromosomes. Science 250, 245–250 (1990)
Faraut, T., De Givry, S., Chabrier, P., Derrien, T., Galibert, F., Hitte, C., Schiex, T.: A comparative genome approach to marker ordering. Bioinformatics 23(2), e50 (2007)
Flum, J., Grohe, M.: Parameterized complexity theory. Springer, New York (2006)
Jiang, H., Zhang, C., Zhu, B.: Weak kernels. Electronic Colloquium on Computational Complexity, ECCC Report TR10-005 (October 2010)
Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, USA (2006)
Richard, C.W., et al.: A radiation hybrid map of the proximal long arm of human chromosome 11 containing the multiple endocrine neoplasia type 1 (MEN-1) and bcl-1 disease loci. American Journal of Human Genetics 49(6), 1189 (1991)
Slonim, D., Kruglyak, L., Stein, L., Lander, E.: Building human genome maps with radiation hybrids. Journal of Computational Biology 4(4), 487–504 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, C., Jiang, H., Zhu, B. (2012). Radiation Hybrid Map Construction Problem Parameterized. In: Lin, G. (eds) Combinatorial Optimization and Applications. COCOA 2012. Lecture Notes in Computer Science, vol 7402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31770-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-31770-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31769-9
Online ISBN: 978-3-642-31770-5
eBook Packages: Computer ScienceComputer Science (R0)