Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

On Approximating an Implicit Cover Problem in Biology

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5564))

Included in the following conference series:

Abstract

In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary algorithms. An important subclass of such problems is the implicit set cover (or, equivalently, hitting set) problem in which the sets are not given explicitly but rather defined implicitly. For example, the well-known minimum feedback arc set problem is such a problem. In this paper, we consider such a cover problem that arises in the study of wild populations in biology in which the sets are defined implicitly via the Mendelian constraints and prove approximability results for this problem.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Almudevar, A.: A simulated annealing algorithm for maximum likelihood pedigree reconstruction. Theoretical Population Biology 63, 63–75 (2003)

    Article  MATH  Google Scholar 

  2. Almudevar, A., Field, C.: Estimation of single generation sibling relationships based on DNA markers. Journal of Agricultural, Biological, and Environmental Statistics 4, 136–165 (1999)

    Article  MathSciNet  Google Scholar 

  3. Arora, S., Lund, C.: Hardness of Approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems. PWS Publishing (1996)

    Google Scholar 

  4. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ashley, M.V., Caballero, I.C., Chaovalitwongse, W., DasGupta, B., Govindan, P., Sheikh, S., Berger-Wolf, T.Y.: KINALYZER, A Computer Program for Reconstructing Sibling Groups, to appear in Molecular Ecology Resources

    Google Scholar 

  6. Ashley, M., Berger-Wolf, T., Berman, P., Chaovalitwongse, W., DasGupta, B., Kao, M.-Y.: On Approximating Four Covering/Packing Problems. To appear in Journal of Computer and System Sciences

    Google Scholar 

  7. Berger-Wolf, T.Y., DasGupta, B., Chaovalitwongse, W., Ashley, M.V.: Combinatorial reconstruction of sibling relationships. In: Proceedings of the 6th International Symposium on Computational Biology and Genome Informatics, pp. 1252–1255 (2005)

    Google Scholar 

  8. Berger-Wolf, T.Y., Sheikh, S., DasGupta, B., Ashley, M.V., Caballero, I., Chaovalitwongse, W., Putrevu, S.L.: Reconstructing Sibling Relationships in Wild Populations. Bioinformatics (special issue of ISMB 2007) 23(13), i49–i56 (2007)

    Google Scholar 

  9. Beyer, J., May, B.: A graph-theoretic approach to the partition of individuals into full-sib families. Molecular Ecology 12, 2243–2250 (2003)

    Article  Google Scholar 

  10. Blouin, M.S.: DNA-based methods for pedigree reconstruction and kinship analysis in natural populations. TRENDS in Ecology and Evolution 18(10), 503–511 (2003)

    Article  Google Scholar 

  11. Butler, K., Field, C., Herbinger, C., Smith, B.: Accuracy, efficiency and robustness of four algorithms allowing full sibship reconstruction from DNA marker data. Molecular Ecology 13, 1589–1600 (2004)

    Article  Google Scholar 

  12. Caprara, A., Rizzi, R.: Packing Triangles in Bounded Degree Graphs. Information Processing Letters 84(4), 175–180 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Chaovalitwongse, W., Berger-Wolf, T.Y., DasGupta, B., Ashley, M.V.: Set covering approach for reconstruction of sibling relationships. Optimization Methods and Software 22(1), 11–24 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  14. Chaovalitwongse, W., Chou, C.-A., Berger-Wolf, T., DasGupta, B., Sheikh, S., Ashley, M., Caballero, I.: New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers. To appear in INFORMS Journal of Computing

    Google Scholar 

  15. Feige, U.: A threshold for approximating set cover. JACM 45, 634–652 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Feige, U., Lovasz, L.: Two-prover one-round proof systems: their power and their problems. In: Proc. 24th annual ACM symposium on Theory of computing, pp. 733–744 (1992)

    Google Scholar 

  17. Jones, A.G., Ardren, W.R.: Methods of parentage analysis in natural populations. Molecular Ecology (12), 2511–2523 (2003)

    Article  Google Scholar 

  18. Konovalov, D.A., Manning, C., Henshaw, M.T.: KINGROUP: a program for pedigree relationship reconstruction and kin group assignments using genetic markers. Molecular Ecology Notes, doi: 10.1111/j.1471-8286.2004.00796.x

    Google Scholar 

  19. Kortsarz, G., Krauthgamer, R., Lee, J.R.: Hardness of Approximating Vertex-Connectivity Network Design Problems. SIAM J. of Computing 33(3), 704–720 (2004)

    Article  MATH  Google Scholar 

  20. Painter, I.: Sibship reconstruction without parental information. Journal of Agricultural, Biological, and Environmental Statistics 2, 212–229 (1997)

    Article  MathSciNet  Google Scholar 

  21. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  22. Raz, R.: A parallel repetition theorem. SIAM J. of Computing 27(3), 763–803 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  23. Sheikh, S.I., Berger-Wolf, T.Y., Ashley, M.V., Caballero, I.C., Chaovalitwongse, W., DasGupta, B.: Error Tolerant Sibship Reconstruction in Wild Populations. In: Markstein, P., Xu, Y. (eds.) Computational Systems Bioinformatics, pp. 273–284. World Scientific Publishers, Singapore (2008)

    Chapter  Google Scholar 

  24. Sheikh, S.I., Berger-Wolf, T.Y., Khokhar, A.A., DasGupta, B.: Consensus Methods for Reconstruction of Sibling Relationships from Genetic Data. In: 4th Multidisciplinary Workshop on Advances in Preference Handling, Chicago, IL (2008)

    Google Scholar 

  25. Smith, B.R., Herbinger, C.M., Merry, H.R.: Accurate partition of individuals into full-sib families from genetic data without parental information. Genetics 158, 1329–1338 (2001)

    Google Scholar 

  26. Thomas, S.C., Hill, W.G.: Sibship reconstruction in hierarchical population structures using markov chain monte carlo techniques. Genet. Res., Camb. 79, 227–234 (2002)

    Article  Google Scholar 

  27. Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  28. Wang, J.: Sibship reconstruction from genetic data with typing errors. Genetics 166, 1968–1979 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Biological Sciences, University of Illinois at Chicago, 840 West Taylor Street, Chicago, IL 60607, USA

    Mary V. Ashley

  2. Department of Computer Science, University of Illinois at Chicago, 851 South Morgan Street, Chicago, IL 60607, USA

    Tanya Y. Berger-Wolf, Bhaskar DasGupta, Ashfaq Khokhar & Saad Sheikh

  3. Department of Industrial Engineering, Rutgers University, PO Box 909, Piscataway, NJ 08855, USA

    Wanpracha Chaovalitwongse

Authors
  1. Mary V. Ashley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tanya Y. Berger-Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wanpracha Chaovalitwongse
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bhaskar DasGupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ashfaq Khokhar
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Saad Sheikh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research – Silicon Valley, 1065 La Avenida, Mountain View, CA 94062, USA

    Andrew V. Goldberg

  2. Rocket Fuel Inc., 350 Marine Parkway, CA 94065, Marina Park Center, USA

    Yunhong Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ashley, M.V., Berger-Wolf, T.Y., Chaovalitwongse, W., DasGupta, B., Khokhar, A., Sheikh, S. (2009). On Approximating an Implicit Cover Problem in Biology. In: Goldberg, A.V., Zhou, Y. (eds) Algorithmic Aspects in Information and Management. AAIM 2009. Lecture Notes in Computer Science, vol 5564. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02158-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02158-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02157-2

  • Online ISBN: 978-3-642-02158-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation