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

Optimal algorithms for comparing trees with labeled leaves

Author

Listed:
  • William Day

Abstract

No abstract is available for this item.

Suggested Citation

  • William Day, 1985. "Optimal algorithms for comparing trees with labeled leaves," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 7-28, December.
    • Handle: RePEc:spr:jclass:v:2:y:1985:i:1:p:7-28
    DOI: 10.1007/BF01908061
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01908061
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01908061?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. Frank Restle, 1959. "A metric and an ordering on sets," Psychometrika, Springer;The Psychometric Society, vol. 24(3), pages 207-220, September.
    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. Isabella Morlini & Sergio Zani, 2012. "Dissimilarity and similarity measures for comparing dendrograms and their applications," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 6(2), pages 85-105, July.
    2. Jean-Pierre Barthélemy & Bruno Leclerc & Bernard Monjardet, 1986. "On the use of ordered sets in problems of comparison and consensus of classifications," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 187-224, September.
    3. 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.
    4. Edward Adams, 1986. "N-trees as nestings: Complexity, similarity, and consensus," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 299-317, September.

    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. Giandomenico Majone, 1972. "Social space and social distance: Some remarks on metric methods in data analysis," Quality & Quantity: International Journal of Methodology, Springer, vol. 6(2), pages 239-252, December.
    2. Roger Shepard, 1962. "The analysis of proximities: Multidimensional scaling with an unknown distance function. II," Psychometrika, Springer;The Psychometric Society, vol. 27(3), pages 219-246, September.
    3. J. Sutcliffe, 1986. "Differential ordering of objects and attributes," Psychometrika, Springer;The Psychometric Society, vol. 51(2), pages 209-240, June.
    4. James Corter & Amos Tversky, 1986. "Extended similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 51(3), pages 429-451, September.
    5. Karl Klauer, 1989. "Ordinal network representation: Representing proximities by graphs," Psychometrika, Springer;The Psychometric Society, vol. 54(4), pages 737-750, September.
    6. Wayne DeSarbo & Michael Johnson & Ajay Manrai & Lalita Manrai & Elizabeth Edwards, 1992. "Tscale: A new multidimensional scaling procedure based on tversky's contrast model," Psychometrika, Springer;The Psychometric Society, vol. 57(1), pages 43-69, 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:jclass:v:2:y:1985:i:1:p:7-28. 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.