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

The complexity of reconstructing trees from qualitative characters and subtrees

Author

Listed:
  • Michael Steel

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jclass:v:9:y:1992:i:1:p:91-116
    DOI: 10.1007/BF02618470
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02618470
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02618470?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. 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.
    2. 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.
    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. 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.
    2. 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.
    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. Bang Ye Wu, 2004. "Constructing the Maximum Consensus Tree from Rooted Triples," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 29-39, March.
    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. 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.
    7. 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.
    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.

    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. Mariana Constantinescu & David Sankoff, 1995. "An efficient algorithm for supertrees," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 101-112, March.
    3. 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.
    4. Mariana Constantinescu & David Sankoff, 1986. "Tree enumeration modulo a consensus," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 349-356, September.
    5. Gildas Brossier, 1990. "Piecewise hierarchical clustering," Journal of Classification, Springer;The Classification Society, vol. 7(2), pages 197-216, September.
    6. 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.

    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:9:y:1992:i:1:p:91-116. 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.