Abstract
We study the parameterized complexity of the complementary maximal strip recovery problem (CMSR), which is to delete the minimum number of gene markers from two genetic maps so that the remaining markers in the maps can be partitioned into matched strips. It is known that the CMSR problem has a kernel of size bounded by 78k, and a question has been raised whether this bound can be further improved. In this paper, we answer this question by presenting an improved kernel of size 58k for the CMSR problem. Our results are based on the techniques of building a weighted bipartite graph from a given instance of the CMSR problem so that three additional and more powerful reduction rules can be applied to further reduce the kernel size.
This work is supported by the National Natural Science Foundation of China under Grants (61232001, 61472449, 61420106009, 61402054).
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
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer-Verlag (1999)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Niedermeier, R.: Invitation to fixed-parameter algorithms (2006)
Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31–45 (2007)
Zheng, C., Zhu, Q., Sankoff, D.: Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE/ACM Transactions on Computational Biology and Bioinformatics 4(4), 515–522 (2007)
Wang, L., Zhu, B.: On the tractability of maximal strip recovery. Journal of Computational Biology 17(7), 907–914 (2010)
Bulteau, L., Fertin, G., Rusu, I.: Maximal strip recovery problem with gaps: hardness and approximation algorithms. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 710–719. Springer, Heidelberg (2009)
Jiang, M.: Inapproximability of maximal strip recovery. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 616–625. Springer, Heidelberg (2009)
Jiang, M.: Inapproximability of maximal strip recovery: II. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 53–64. Springer, Heidelberg (2010)
Choi, V., Zheng, C., Zhu, Q., Sankoff, D.: Algorithms for the extraction of synteny blocks from comparative maps. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol. 4645, pp. 277–288. Springer, Heidelberg (2007)
Chen, Z., Fu, B., Jiang, M., Zhu, B.: On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3), 307–318 (2009)
Jiang, H., Li, Z., Lin, G., Wang, L., Zhu, B.: Exact and approximation algorithms for the complementary maximal strip recovery problem. J. Comb. Optim. 23(4), 493–506 (2012)
Li, Z., Goebel, R., Wang, L., Lin, G.: An improved approximation algorithm for the complementary maximal strip recovery problem. J. Comput. Syst. Sci. 78(3), 720–730 (2012)
Bulteau, L., Fertin, G., Jiang, M., Rusu, I.: Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440(441), 14–28 (2012)
Jiang, H., Zhu, B.: A linear kernel for the complementary maximal strip recovery problem. Journal of Computer and System Sciences (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Hu, S., Li, W., Wang, J. (2015). An Improved Kernel for the Complementary Maximal Strip Recovery Problem. In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science(), vol 9198. Springer, Cham. https://doi.org/10.1007/978-3-319-21398-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-21398-9_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21397-2
Online ISBN: 978-3-319-21398-9
eBook Packages: Computer ScienceComputer Science (R0)