%0 Conference Paper %1 kantschik:2001:EuroGP %A Kantschik, Wolfgang %A Banzhaf, Wolfgang %B Genetic Programming, Proceedings of EuroGP'2001 %C Lake Como, Italy %D 2001 %E Miller, Julian F. %E Tomassini, Marco %E Lanzi, Pier Luca %E Ryan, Conor %E Tettamanzi, Andrea G. B. %E Langdon, William B. %I Springer-Verlag %K Crossover GP Linear algorithms, genetic programming, representation, structure, tree %P 302--312 %T Linear-Tree GP and its comparison with other GP structures %U http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2038&spage=302 %V 2038 %X In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution we introduce a new kind of GP structure which we call linear-tree. We describe the linear-tree-structure, as well as crossover and mutation for this new GP structure in detail. We compare linear-tree programs with linear and tree programs by analyzing their structure and results on different test problems. %@ 3-540-41899-7

@inproceedings{kantschik:2001:EuroGP, abstract = {In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution we introduce a new kind of GP structure which we call linear-tree. We describe the linear-tree-structure, as well as crossover and mutation for this new GP structure in detail. We compare linear-tree programs with linear and tree programs by analyzing their structure and results on different test problems.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Lake Como, Italy}, author = {Kantschik, Wolfgang and Banzhaf, Wolfgang}, biburl = {https://www.bibsonomy.org/bibtex/25edb0f02f17796912adf06160b16e05a/brazovayeye}, booktitle = {Genetic Programming, Proceedings of EuroGP'2001}, editor = {Miller, Julian F. and Tomassini, Marco and Lanzi, Pier Luca and Ryan, Conor and Tettamanzi, Andrea G. B. and Langdon, William B.}, interhash = {742e99d380d88a7fb319f88659935b9d}, intrahash = {5edb0f02f17796912adf06160b16e05a}, isbn = {3-540-41899-7}, keywords = {Crossover GP Linear algorithms, genetic programming, representation, structure, tree}, month = {18-20 April}, notes = {EuroGP'2001, part of \cite{miller:2001:gp}}, organisation = {EvoNET}, pages = {302--312}, publisher = {Springer-Verlag}, publisher_address = {Berlin}, series = {LNCS}, size = {11 pages}, timestamp = {2008-06-19T17:42:54.000+0200}, title = {Linear-Tree {GP} and its comparison with other {GP} structures}, url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2038&spage=302}, volume = 2038, year = 2001 }