IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v11y2006i4d10.1007_s10878-006-8212-8.html
   My bibliography  Save this article

Inapproximability results for the lateral gene transfer problem

Author

Listed:
  • Bhaskar Dasgupta

    (University of Illinois at Chicago)

  • Sergio Ferrarini

    (Politecnico di Milano)

  • Uthra Gopalakrishnan

    (University of Illinois at Chicago)

  • Nisha Raj Paryani

    (University of Illinois at Chicago)

Abstract

This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallett and Lagergren (2001), is that of finding the most parsimonious lateral gene transfer scenario for a given pair of gene and species trees. Our main results are the following: (a) We show that it is not possible to approximate the problem in polynomial time within an approximation ratio of 1 + ε, for some constant ε > 0 unless P = NP. We also provide explicit values of ε for the above claim. (b) We provide an upper bound on the cost of any 1-active scenario and prove the tightness of this bound.

Suggested Citation

  • Bhaskar Dasgupta & Sergio Ferrarini & Uthra Gopalakrishnan & Nisha Raj Paryani, 2006. "Inapproximability results for the lateral gene transfer problem," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 387-405, June.
    • Handle: RePEc:spr:jcomop:v:11:y:2006:i:4:d:10.1007_s10878-006-8212-8
    DOI: 10.1007/s10878-006-8212-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-8212-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-006-8212-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Damir Hasić & Eric Tannier, 2019. "Gene tree reconciliation including transfers with replacement is NP-hard and FPT," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 502-544, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:11:y:2006:i:4:d:10.1007_s10878-006-8212-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.