IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i1d10.1007_s10878-015-9921-7.html
   My bibliography  Save this article

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees

Author

Listed:
  • Feng Shi

    (Central South University
    Hunan Engineering Center for Currency Recognition and Self-Service)

  • Qilong Feng

    (Central South University
    Hunan Engineering Center for Currency Recognition and Self-Service)

  • Jie You

    (Central South University
    Hunan Engineering Center for Currency Recognition and Self-Service)

  • Jianxin Wang

    (Central South University
    Hunan Engineering Center for Currency Recognition and Self-Service)

Abstract

Given two rooted binary phylogenetic trees with identical leaf label-set, the maximum agreement forest (MAF) problem asks for a largest common subforest of the two trees. This problem has been studied extensively in the literature, and has been known to be NP-complete and MAX SNP-hard. The previously best ratio of approximation algorithms for this problem is 3. In this paper, we make full use of the special relations among leaves in phylogenetic trees and present an approximation algorithm with ratio 2.5 for the MAF problem on two rooted binary phylogenetic trees.

Suggested Citation

  • Feng Shi & Qilong Feng & Jie You & Jianxin Wang, 2016. "Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 111-143, July.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9921-7
    DOI: 10.1007/s10878-015-9921-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9921-7
    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-015-9921-7?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:32:y:2016:i:1:d:10.1007_s10878-015-9921-7. 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.