Skip to main content
SpringerLink
Log in

Randomized Parameterized Algorithms for Co-path Set Problem

  • Conference paper
Frontiers in Algorithmics (FAW 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Included in the following conference series:

Abstract

Co-path Set problem is of important applications in mapping unique DNA sequences onto chromosomes and whole genomes. Given a graph G, the parameterized version of Co-path Set problem is to find a subset F of edges with size at most k such that each connected component in G[E\F] is a path. In this paper, we give a kernel of size 9k for the problem, and a randomized algorithm of running time O *(2.29k) is presented for the Parameterized Co-path Set problem.

This work is supported by the National Natural Science Foundation of China under Grant (61232001, 61103033, 61173051).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, Z., Lin, G., Wang, L.: An approximation algorithm for the minimum co-path set problem. Algorithmica 60, 969–986 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cheng, Y., Cai, Z., Goebel, R., Lin, G., Zhu, B.: The radiation hybrid map construction problem: recognition, hardness, and approximation algorithms (2008) (unpublished manuscript)

    Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W.H. Freeman (1979)

    Google Scholar 

  5. Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704–714 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Jiang, H., Zhang, C., Zhu, B.: Weak kernels. ECCC Report, TR10-005 (2010)

    Google Scholar 

  7. Kanj, I., Xia, G., Zhu, B.: The Radiation Hybrid Map Construction Problem Is FPT. In: Cai, Z., Eulenstein, O., Janies, D., Schwartz, D. (eds.) ISBRA 2013. LNCS, vol. 7875, pp. 5–16. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Richard, C.W., Withers, D.A., Meeker, T.C., Maurer, S., Evans, G.A., Myers, R.M., Cox, D.R.: 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 J. of Human Genetics 49, 1189–1196 (1991)

    Google Scholar 

  9. Slonim, D., Kruglyak, L., Stein, L., Lander, E.: Building human genome maps with radiation hybrids. J. of Computational Biology 4, 487–504 (1997)

    Article  Google Scholar 

  10. Zhang, C., Jiang, H., Zhu, B.: Radiation Hybrid Map Construction Problem Parameterized. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 127–137. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, 410083, P.R. China

    Qilong Feng, Qian Zhou & Shaohua Li

  2. Information School, Guangdong University of Commercial Studies, Guangzhou, 510320, P.R. China

    Shaohua Li

Authors
  1. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qian Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shaohua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Feng, Q., Zhou, Q., Li, S. (2014). Randomized Parameterized Algorithms for Co-path Set Problem. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation