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

Faster exact computation of rSPR distance

Author

Listed:
  • Zhi-Zhong Chen

    (Tokyo Denki University)

  • Ying Fan

    (City University of Hong Kong)

  • Lusheng Wang

    (City University of Hong Kong)

Abstract

Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this case, we want to measure the dissimilarity of the two trees. The rooted subtree prune and regraft (rSPR) distance of the two trees has been used for this purpose, and many algorithms and software tools have been developed for computing the rSPR distance of two given phylogenetic trees. The previously fastest exact algorithm for this problem runs in $$O\left( 2.415^dn\right) $$ O 2 . 415 d n time, where $$n$$ n and $$d$$ d are the number of leaves and the rSPR distance of the input trees, respectively. In this paper, we present a faster exact algorithm which runs in $$O\left( 2.344^dn\right) $$ O 2 . 344 d n time. Our experiments show that the new algorithm is significantly faster than the newest version (namely, v1.1.1) of the previously best software (namely, rSPR) for RSPR distance.

Suggested Citation

  • Zhi-Zhong Chen & Ying Fan & Lusheng Wang, 2015. "Faster exact computation of rSPR distance," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 605-635, April.
    • Handle: RePEc:spr:jcomop:v:29:y:2015:i:3:d:10.1007_s10878-013-9695-8
    DOI: 10.1007/s10878-013-9695-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9695-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-013-9695-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.

    References listed on IDEAS

    as
    1. Bin Ma & Louxin Zhang, 2011. "Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 409-422, May.
    2. Leszek Gasieniec & Jesper Jansson & Andrzej Lingas & Anna Östlin, 1999. "On the Complexity of Constructing Evolutionary Trees," Journal of Combinatorial Optimization, Springer, vol. 3(2), pages 183-197, July.
    3. Bin Ma & Lusheng Wang & Louxin Zhang, 1999. "Fitting Distances by Tree Metrics with Increment Error," Journal of Combinatorial Optimization, Springer, vol. 3(2), pages 213-225, July.
    Full references (including those not matched with items on IDEAS)

    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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bang Ye Wu, 2004. "Constructing the Maximum Consensus Tree from Rooted Triples," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 29-39, March.

    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:29:y:2015:i:3:d:10.1007_s10878-013-9695-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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.