IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v27y2010i2p136-157.html
   My bibliography  Save this article

Minimum Tree Cost Quartet Puzzling

Author

Listed:
  • Tudor Ionescu
  • Géraldine Polaillon
  • Frédéric Boulanger

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jclass:v:27:y:2010:i:2:p:136-157
    DOI: 10.1007/s00357-010-9053-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00357-010-9053-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00357-010-9053-9?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. Shmuel Sattath & Amos Tversky, 1977. "Additive similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 42(3), pages 319-345, September.
    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. 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.
    2. Olga Fajarda & Cristina Requejo, 2022. "MIP model-based heuristics for the minimum weighted tree reconstruction problem," Operational Research, Springer, vol. 22(3), pages 2305-2342, July.
    3. 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.
    4. Fortz, Bernard & Oliveira, Olga & Requejo, Cristina, 2017. "Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 242-251.
    5. J. Carroll & James Corter, 1995. "A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees," Journal of Classification, Springer;The Classification Society, vol. 12(2), pages 283-313, September.
    6. Nudelman, Gabriel & Shiloh, Shoshana, 2015. "Mapping health behaviors: Constructing and validating a common-sense taxonomy of health behaviors," Social Science & Medicine, Elsevier, vol. 146(C), pages 1-10.
    7. Wayne DeSarbo & Vijay Mahajan, 1984. "Constrained classification: The use of a priori information in cluster analysis," Psychometrika, Springer;The Psychometric Society, vol. 49(2), pages 187-215, June.
    8. Michel Wedel & Wayne DeSarbo, 1998. "Mixtures of (constrained) ultrametric trees," Psychometrika, Springer;The Psychometric Society, vol. 63(4), pages 419-443, December.
    9. J. Carroll & Linda Clark & Wayne DeSarbo, 1984. "The representation of three-way proximity data by single and multiple tree structure models," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 25-74, December.
    10. Robert Coles & Gerard P. Hodgkinson, 2008. "A Psychometric Study of Information Technology Risks in the Workplace," Risk Analysis, John Wiley & Sons, vol. 28(1), pages 81-93, February.
    11. 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.
    12. 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.
    13. repec:dgr:rugsom:96b34 is not listed on IDEAS
    14. J. Sutcliffe, 1986. "Differential ordering of objects and attributes," Psychometrika, Springer;The Psychometric Society, vol. 51(2), pages 209-240, June.
    15. J. Hutchinson & Amitabh Mungale, 1997. "Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures," Psychometrika, Springer;The Psychometric Society, vol. 62(1), pages 85-117, March.
    16. Lant, Theresa & Shapira, Zur, 2008. "Managerial reasoning about aspirations and expectations," Journal of Economic Behavior & Organization, Elsevier, vol. 66(1), pages 60-73, April.
    17. James Corter & Amos Tversky, 1986. "Extended similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 51(3), pages 429-451, September.
    18. Catanzaro, Daniele & Aringhieri, Roberto & Di Summa, Marco & Pesenti, Raffaele, 2015. "A branch-price-and-cut algorithm for the minimum evolution problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 753-765.
    19. Sandra Pruzansky & Amos Tversky & J. Carroll, 1982. "Spatial versus tree representations of proximity data," Psychometrika, Springer;The Psychometric Society, vol. 47(1), pages 3-24, March.
    20. Cotta, Carlos, 2006. "Scatter search with path relinking for phylogenetic inference," European Journal of Operational Research, Elsevier, vol. 169(2), pages 520-532, March.
    21. Varone, Sacha C., 2006. "A constructive algorithm for realizing a distance matrix," European Journal of Operational Research, Elsevier, vol. 174(1), pages 102-111, October.

    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:jclass:v:27:y:2010:i:2:p:136-157. 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.