Citation Context

... a tree based representation like that of GP. Even though CGP did not have Automatically Defined Functions (ADFs) it was shown that CGP performed better than GP with ADFs over a series of problems [5]=-=[6]-=-. The work reported in this paper implements for the first time in CGP a form of ADFs by automatically acquiring and evolving modules. We call it Embedded CGP (ECGP) as it is a representation that use...

Citation Context

...as proved to be very difficult for evolutionarystechniques (particularly when the number of bits in the multiplicands is greater thansthree) [4][7][11][12][13]. Cartesian Genetic Programming (CGP) [5]=-=[6]-=- is one technique that has been used to attack such problems. Even though CGP does not have thesequivalent of Automatically Defined Functions (ADFs) it was empirically demonstrated to be more computat...

Citation Context

...d through the clone coverage. In addition, the identification of transcripts is essential in any analysis of a region expected to contain a gene associated with a medically important genetic disorder =-=(9)-=-. A number of different approaches have been developed to identify genes by a large number of different criteria. The techniques utilised have relied on data derived from 'zoo' blots (10), random cDNA...

Citation Context

...or new ways to make it a more powerful tool, so GP can be applied to larger and more complex problems. In the late nineties, one such technique called Cartesian Genetic Programming (CGP) was proposed =-=[7]-=-, which used a directed graph representation instead of the standard tree based representation of GP. This alternative representation gave the technique a number of advantages over the traditional GP ...

Citation Context

...enetically represented images and the way in which evolution is simulated also varies. In this paper we use a relatively new form of Genetic Programming [1] called Cartesian Genetic Programming (CGP) =-=[3]-=-. This is the first use of this technique in evolutionary art. There are several features of CGP that make it very suitable for using in evolutionary art. These features include the way in which progr...

Citation Context

...1, df = 1). The frequency of chimeric YACs in the Rad+ parent is similar to that reported previously for YACs in Rad+ hosts (eg., 43% by Selleri et al. (7) based on FISH analysis; 52% by Bates et al. =-=(8)-=- based on mapping insert-end STSs). There was no significant difference between the two Rad~ hosts (4 out of 29 examined, or 14% chimerism in the radlrad52 host vs. 4 out of 47, or 9% in the rad52 hos...

Citation Context

...vel DNA fragments in the DNA of CMT1A patients, reflecting the junction fragments, have been analyzed previously using probes VAW409R3a and PMP-22cDNA and the restriction enzymes SacII, Fspl and AscI =-=(18, 20)-=-. To map the break point in more detail, we isolated a single copy probe, located in the vicinity of die break point (see figure 3). This probe, 62B, enabled us to detect the junction after restrictio...

Citation Context

...as proved to be very difficult for evolutionary techniques (particularly when the number of bits in the multiplicands is greater than three) [4][7][11][12][13]. Cartesian Genetic Programming (CGP) [5]=-=[6]-=- is one technique that has been used to attack such problems. Even though CGP does not have the equivalent of Automatically Defined Functions (ADFs) it was empirically demonstrated to be more computat...