GEP表现型的两个上界约束定理及算法  

Two Upper Bound Constraint Theorems and Algorithms for GEP Phenotype

作　　者：郭勇[1] 余泉[2] 司永洁 Guo Yong;Yu Quan;Si Yongjie(School of Computer and Information,Qiannan Normal University for Nationalities,Duyun 558000,China;School of Mathematics and Statistics, Qiannan Normal University for Nationalities,Duyun 558000,China)

机构地区：[1]黔南民族师范学院计算机与信息学院,贵州都匀558000 [2]黔南民族师范学院数学与统计学院,贵州都匀558000

出　　处：《科技通报》2017年第7期141-146,共6页Bulletin of Science and Technology

基　　金：国家自然科学基金项目(No.61463044);贵州省科技厅联合基金项目(No.20157727)

摘　　要：经典基因表达式编程(GEP)的基因解释基于表现型表达式树,面临离散型表达式树存储的数据结构选择和预定义存储空间大小的问题,本文通过定义GEP表达式树的高度和宽度,提出确定基因头部长度下GEP的表现型表达式树高度和宽度的上界约束定理,给出严谨的数学证明,定理对"广度优先"和"深度优先"建树原则都成立,可根据上界约束定理声明定义相关数据结构的空间大小,做到科学分配存储空间。设计使用面向对象编程语言的对象数组表达表达式树,并给出了"构建表达式树"及"后序遍历解析表达式树"的经典GEP解码算法。Traditional gene expression programming(GEP)decoding is based on the phenotype expressiontree.In the realization of constructing trees and decoding,there will be some problems,including thechoice of express storage data structure for discrete expression tree,statement and definition for theheight of expression trees,determination of space size for single layer nodes and so on.In this paper,twoupper bound theorems and their proofs,which are for the height of phenotype expression trees andnumbers of nodes in single layer of GEP gene,are proposed,based on determined head length of thegene.The theorems are established for two principles of contributing trees,“breadth first”and“depthfirst”,solving the problem of determining related attributes of GEP data structure for expression tree,andan GEP algorithm of constructing trees and decoding,using the object array based on object orientedprogramming language to express the discrete expression tree,is presented.

关 键 词：基因表达式编程 表达式树 解码 算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]