Analysing the regularity of genomes using compression and expression simplification

Authors:
Jungseok Shin;Moonyoung Kang;R. I. McKay;Xuan Nguyen;Tuan-Hao Hoang;Naoki Mori;Daryl Essam
Affiliations:
Structural Complexity Laboratory, Seoul National University, Seoul, Korea;Structural Complexity Laboratory, Seoul National University, Seoul, Korea;Structural Complexity Laboratory, Seoul National University, Seoul, Korea;Natural Computation Group, VietNam Military Technical Academy, Hanoi;Australian Defence Force Academy, Campbell, ACT;Osaka Prefecture University, Osaka, Japan;Australian Defence Force Academy, Campbell, ACT
Venue:
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Year:
2007

Citing 6
Cited 2

Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Shorter Fitness Preserving Genetic Programs

AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Compressing XML with Multiplexed Hierarchical PPM Models

DCC '01 Proceedings of the Data Compression Conference
Improving the accuracy and robustness of genetic programming through expression simplification

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Modularity in genetic programming

EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Genetic transposition in tree-adjoining grammar guided genetic programming: the duplication operator

EuroGP'05 Proceedings of the 8th European conference on Genetic Programming

Estimating the distribution and propagation of genetic programming building blocks through tree compression

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Building on success in genetic programming: adaptive variation and developmental evaluation

ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose expression simplification and tree compression as aids in understanding the evolution of regular structure in Genetic Programming individuals.We apply the analysis to two previously-published algorithms, which aimed to promote regular and repeated structure. One relies on subtree duplication operators, the other uses repeated evaluation during a developmental process. Both successfully generated solutions to difficult problems, their success being ascribed to promotion of regular structure. Our analysis modifies this ascription: the evolution of regular structure is more complex than anticipated, and the success of the techniques may have arisen from a combination of promotion of regularity, and other, so far unidentified, effects.