An efficient algorithm for supertrees
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- Mariana Constantinescu & David Sankoff, 1986. "Tree enumeration modulo a consensus," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 349-356, September.
More about this item
KeywordsTree compatibility; Constraints on trees; Supertrees; Consensus trees;
StatisticsAccess and download statistics
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:101-112. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .