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

An algorithm to find agreement subtrees

Author

Listed:
  • Ewa Kubicka
  • Grzegorz Kubicki
  • F. McMorris

Abstract

No abstract is available for this item.

Suggested Citation

  • Ewa Kubicka & Grzegorz Kubicki & F. McMorris, 1995. "An algorithm to find agreement subtrees," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 91-99, March.
    • Handle: RePEc:spr:jclass:v:12:y:1995:i:1:p:91-99
    DOI: 10.1007/BF01202269
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01202269
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01202269?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. C. Finden & A. Gordon, 1985. "Obtaining common pruned trees," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 255-276, December.
    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. 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.
    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. AD Gordon, 1986. "Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 335-348, September.

    More about this item

    Keywords

    Pruning vertices; Agreement subtree;

    Statistics

    Access and download statistics

    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:12:y:1995:i:1:p:91-99. 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.