OBTAINING COMMON PRUNED TREES

OBTAINING COMMON PRUNED TREES
复制标题

DOI:
10.1007/bf01908078
复制
发表时间:
1985-01-01
影响因子:
2
通讯作者:
GORDON, AD
GORDON, AD
中科院分区:
计算机科学4区
文献类型:
--
作者:
FINDEN, CR;GORDON, AD

文献摘要

被引文献

相似文献

给定两个或两个以上的树状图(根树图)基于同一组对象,方法定义和获得共同修剪树。一个最大的共同修剪树的大小上的界限被引入,是一个分类的对象,根据它们是否属于所有,一些,或没有最大的共同修剪树。还描述了一种重新嫁接修剪过的树枝的过程,产生的树木可以评估所描绘的关系的可靠性。通过将分支重新嫁接到最大的普通修剪树上而得到的树包含严格共识树中存在的所有类。这一理论说明了两个分类的一组49地层花粉光谱的应用程序。
Given two or more dendrograms (rooted tree diagrams) based on the same set of objects, ways are presented of defining and obtaining common pruned trees. Bounds on the size of a largest common pruned tree are introduced, as is a categorization of objects according to whether they belong to all, some, or no largest common pruned trees. Also described is a procedure for regrafting pruned branches, yielding trees for which one can assess the reliability of the depicted relationships. The tree obtained by regrafting branches on to a largest common pruned tree is shown to contain all the classes present in the strict consensus tree. The theory is illustrated by application to two classifications of a set of forty-nine stratigraphical pollen spectra.