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

Recognizing Treelike k-Dissimilarities

Author

Listed:
  • Sven Herrmann
  • Katharina Huber
  • Vincent Moulton
  • Andreas Spillner

Abstract

A k-dissimilarity D on a finite set X, |X| ≥ k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edgeweighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y ) is defined to be the total length of the smallest subtree of T with leaf-set Y . In case k = 2, it is well-known that 2-dissimilarities arising in this way can be characterized by the so-called “4-point condition”. However, in case k > 2 Pachter and Speyer ( 2004 ) recently posed the following question: Given an arbitrary k-dissimilarity, how do we test whether this map comes from a tree? In this paper, we provide an answer to this question, showing that for k ≥ 3 a k-dissimilarity on a set X arises from a tree if and only if its restriction to every 2 k-element subset of X arises from some tree, and that 2 k is the least possible subset size to ensure that this is the case. As a corollary, we show that there exists a polynomial-time algorithm to determine when a k-dissimilarity arises from a tree. We also give a 6-point condition for determining when a 3-dissimilarity arises from a tree, that is similar to the aforementioned 4-point condition. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Sven Herrmann & Katharina Huber & Vincent Moulton & Andreas Spillner, 2012. "Recognizing Treelike k-Dissimilarities," Journal of Classification, Springer;The Classification Society, vol. 29(3), pages 321-340, October.
    • Handle: RePEc:spr:jclass:v:29:y:2012:i:3:p:321-340
    DOI: 10.1007/s00357-012-9115-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00357-012-9115-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00357-012-9115-2?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. Geert Soete, 1983. "A least squares algorithm for fitting additive trees to proximity data," Psychometrika, Springer;The Psychometric Society, vol. 48(4), pages 621-626, December.
    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. Douglas L. Steinley, 2019. "Editorial: Journal of Classification Vol. 36-3," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 393-396, October.
    2. Elena Rubei, 2013. "On the weights of simple paths in weighted complete graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 44(4), pages 511-525, August.
    3. Elena Rubei, 2016. "Weighted Graphs with Distances in Given Ranges," Journal of Classification, Springer;The Classification Society, vol. 33(2), pages 282-297, July.
    4. Agnese Baldisserri & Elena Rubei, 2018. "Treelike Families of Multiweights," Journal of Classification, Springer;The Classification Society, vol. 35(2), pages 367-390, July.
    5. Katharina T. Huber & Vincent Moulton & Guillaume E. Scholz, 2019. "Three-Way Symbolic Tree-Maps and Ultrametrics," Journal of Classification, Springer;The Classification Society, vol. 36(3), pages 513-540, October.
    6. Simone Calamai, 2020. "Moduli Space of Families of Positive (n − 1)-Weights," Journal of Classification, Springer;The Classification Society, vol. 37(2), pages 317-327, July.

    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. Olivier Gascuel & Denise Levy, 1996. "A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance," Journal of Classification, Springer;The Classification Society, vol. 13(1), pages 129-155, March.
    2. Geert Soete & J. Carroll & Wayne DeSarbo, 1987. "Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data," Journal of Classification, Springer;The Classification Society, vol. 4(2), pages 155-173, September.
    3. A. Penttinen & W. Krzanowski & J. Kettenring & F. Rohlf & William Day & B. Weir & John Kececioglu & N. Ohsumi & Peter Willett, 1993. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 10(1), pages 125-156, January.
    4. Michael Hendy & David Penny, 1993. "Spectral analysis of phylogenetic data," Journal of Classification, Springer;The Classification Society, vol. 10(1), pages 5-24, January.
    5. Geert Soete, 1986. "Optimal variable weighting for ultrametric and additive tree clustering," Quality & Quantity: International Journal of Methodology, Springer, vol. 20(2), pages 169-180, June.
    6. K. Klauer & J. Carroll, 1989. "A mathematical programming approach to fitting general graphs," Journal of Classification, Springer;The Classification Society, vol. 6(1), pages 247-270, December.
    7. 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.
    8. 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.
    9. Geert Soete, 1984. "Ultrametric tree representations of incomplete dissimilarity data," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 235-242, December.
    10. Akinori Okada & Hans-Hermann Bock & F. Murtagh & F. Rohlf & Wei-Chien Chang & Shizuhiko Nishisato & Robert Sokal & Carolyn Anderson & Frank Critchley & Frank Critchley & Robert Golden, 1989. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 6(1), pages 121-161, December.

    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:29:y:2012:i:3:p:321-340. 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.