IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v8y2004i1d10.1023_bjoco.0000021936.04215.68.html
   My bibliography  Save this article

Constructing the Maximum Consensus Tree from Rooted Triples

Author

Listed:
  • Bang Ye Wu

    (Shu-Te University)

Abstract

We investigated the problem of constructing the maximum consensus tree from rooted triples. We showed the NP-hardness of the problem and developed exact and heuristic algorithms. The exact algorithm is based on the dynamic programming strategy and runs in O((m + n 2)3 n ) time and O(2 n ) space. The heuristic algorithms run in polynomial time and their performances are tested and shown by comparing with the optimal solutions. In the tests, the worst and average relative error ratios are 1.200 and 1.072 respectively. We also implemented the two heuristic algorithms proposed by Gasieniec et al. The experimental result shows that our heuristic algorithm is better than theirs in most of the tests.

Suggested Citation

  • Bang Ye Wu, 2004. "Constructing the Maximum Consensus Tree from Rooted Triples," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 29-39, March.
    • Handle: RePEc:spr:jcomop:v:8:y:2004:i:1:d:10.1023_b:joco.0000021936.04215.68
    DOI: 10.1023/B:JOCO.0000021936.04215.68
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:JOCO.0000021936.04215.68
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:JOCO.0000021936.04215.68?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. Michael Steel, 1992. "The complexity of reconstructing trees from qualitative characters and subtrees," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 91-116, January.
    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.
    Full references (including those not matched with items on IDEAS)

    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. Paul Bastide & Mahendra Mariadassou & Stéphane Robin, 2017. "Detection of adaptive shifts on phylogenies by using shifted stochastic processes on a tree," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(4), pages 1067-1093, September.
    2. Berry, V & Gascuel, O & Caraux, G, 2000. "Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction," Computational Statistics & Data Analysis, Elsevier, vol. 32(3-4), pages 273-283, January.
    3. Tudor Ionescu & Géraldine Polaillon & Frédéric Boulanger, 2010. "Minimum Tree Cost Quartet Puzzling," Journal of Classification, Springer;The Classification Society, vol. 27(2), pages 136-157, September.
    4. DeGiorgio, Michael & Rosenberg, Noah A., 2016. "Consistency and inconsistency of consensus methods for inferring species trees from gene trees in the presence of ancestral population structure," Theoretical Population Biology, Elsevier, vol. 110(C), pages 12-24.
    5. Sergio Consoli & Jan Korst & Gijs Geleijnse & Steffen Pauws, 2019. "An exact algorithm for the minimum quartet tree cost problem," 4OR, Springer, vol. 17(4), pages 401-425, December.
    6. 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.
    7. Sergio Consoli & Jan Korst & Steffen Pauws & Gijs Geleijnse, 2020. "Improved metaheuristics for the quartet method of hierarchical clustering," Journal of Global Optimization, Springer, vol. 78(2), pages 241-270, October.
    8. Nazifa Ahmed Moumi & Badhan Das & Zarin Tasnim Promi & Nishat Anjum Bristy & Md Shamsuzzoha Bayzid, 2019. "Quartet-based inference of cell differentiation trees from ChIP-Seq histone modification data," PLOS ONE, Public Library of Science, vol. 14(9), pages 1-25, September.

    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:8:y:2004:i:1:d:10.1023_b:joco.0000021936.04215.68. 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.