首页 | 本学科首页   官方微博 | 高级检索  
     检索      


N-trees as nestings: Complexity,similarity, and consensus
Authors:Edward N Adams III
Institution:(1) Adams Software, 2782 Waverley Street, 94306 Palo Alto, CA, USA
Abstract:Interpreting a taxonomic tree as a set of objects leads to natural measures of complexity and similarity, and sets natural lower bounds on a consensus tree Interpretations differing as to the kind of objects constituting a tree lead to different measures and consensus Subset nesting is preferred over the clusters (strict consensus) and even the triads interpretations because of its superior expression of shared structure Algorithms for computing the complexity and similarity of trees, as well as a consensus index onto 0,1], are presented for this interpretation The ldquofull consensusrdquo is defined as the only tree which includes all the nestings shared in a profile of rival trees and whose clusters reflect only nestings shared in the profile The full consensus is proved to exist uniquely for each profile, and to equal the Adams consensusThe author is grateful for the many helpful comments on presentation from Frances McA Adams, William H E Day, and Christopher A Meacham
Keywords:Full consensus  Adams consensus  Adams-2 consensus  Strict consensus  Rooted trees
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号