An efficient algorithm for supertrees
No abstract is available for this item.
Volume (Year): 12 (1995)
Issue (Month): 1 (March)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: https://tcs.wildapricot.org/
|Order Information:||Web: http://www.springer.com/statistics/statistical+theory+and+methods/journal/357/PS2|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mariana Constantinescu & David Sankoff, 1986. "Tree enumeration modulo a consensus," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 349-356, September.
- 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.
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)
If references are entirely missing, you can add them using this form.