@inproceedings{eurogp07:shin, title = {Analysing the Regularity of Genomes using Compression and Expression Simplification}, address = {Valencia, Spain}, author = {Jungseok Shin and Moonyoung Kang and Bob McKay and Xuan Nguyen and Tuan-Hao Hoang and Naoki Mori and Daryl Essam}, booktitle = {Proceedings of the 10th European Conference on Genetic Programming}, editor = {Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar}, month = {11 - 13 April}, pages = {251--260}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4445}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/25620c1766ce3a4442081b8ac11ebfc64/brazovayeye}, 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.}, isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007}, doi = {doi:10.1007/978-3-540-71605-1_23}, keywords = {algorithms, genetic programming } }