分支分类学算法研究及其在生物分类中的应用  

Algorithmic Research of Branch Taxonomy and Its Application in Cladistic Classification

作　　者：石勤[1] 王成章[1] 

机构地区：[1]北京工业大学研究生部,北京100022

出　　处：《北京工业大学学报》2001年第3期266-272,共7页Journal of Beijing University of Technology

摘　　要：针对目前普遍采用的分支分类方法一般只能得到局部最优解这一问题，首先提出了一条与俭约性原理等价的定理，然后就使用同步系数进行分类时可能出现的情况进行了讨论，同时给出了几条有关定理．在此基础上，对最大同步法给出了一个反例并提出了一种修正算法．实验结果表明该算法是正确的和可行的，且能保证不劣于最大同步法．The methods of cbranch classification adopted universally at present can only provide a locally optimal solution. Firstly, a theorem equivalent to the principle of Parsimony is put forward in this thesis. And then, some possible cases are discussed when the method of maximal synchronization is used for classification and a few relevant theorems are given. On this basis a example counter for the method of maximal synchronization is raised and an amendment algorithm is given. The experimental results show that thes algorithm is correct and feasible and at least as good as the method of maximal sychronization.

关 键 词：分支分类学 分支谱系图 最大同步法 修正算法 生物分类 同步系数 生物演化 

分 类 号：Q19[生物学—普通生物学] Q－332