{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T01:40:15Z","timestamp":1775785215962,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1023\/a:1015531909333","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:59:19Z","timestamp":1041101959000},"page":"157-192","source":"Crossref","is-referenced-by-count":25,"title":["The Proportional Genetic Algorithm: Gene Expression in a Genetic Algorithm"],"prefix":"10.1007","volume":"3","author":[{"given":"Annie S.","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Garibay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"408587_CR1","unstructured":"J. D. Bagley, \u201cThe behavior of adaptive systems which employ genetic and correlation algorithms,\u201d Ph.D. Thesis, University of Michigan, 1967."},{"key":"408587_CR2","doi-asserted-by":"crossref","unstructured":"W. Banzhaf, \u201cGenotype-phenotype-mapping and neutral variation\u2013A case study in genetic programming,\u201d in Parallel Problem Solving from Nature 3, Y. Davidor, H.-P. Schwefel, and R. Manner (eds.), 1994, pp. 322\u2013332.","DOI":"10.1007\/3-540-58484-6_276"},{"issue":"1","key":"408587_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1073\/pnas.48.1.9","volume":"48","author":"E. Beutler","year":"1962","unstructured":"E. Beutler, M. Yeh, and V. F. Fairbanks, \u201cThe normal human female as a mosaic of X-chromosome activity: Studies using the gene for G-6-PD-Deficiency as a marker,\u201d Proc. Nat'l. Acad. Sci., vol. 48, no. 1, pp. 9\u201316, 1962.","journal-title":"Proc. Nat'l. Acad. Sci."},{"issue":"4","key":"408587_CR4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1162\/evco.1998.6.4.387","volume":"6","author":"D. S. Burke","year":"1998","unstructured":"D. S. Burke, K. A. De Jong, J. J. Grefenstette, C. L. Ramsey, and A. S. Wu, \u201cPutting more genetics into genetic algorithms,\u201d Evolutionary Computation, vol. 6, no. 4, pp. 387\u2013410, 1998.","journal-title":"Evolutionary Computation"},{"key":"408587_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S0140525X97000022","volume":"20","author":"A. Clark","year":"1997","unstructured":"A. Clark and C. Thornton, \u201cTrading spaces: Computation, representation, and the limits of uninformed learning,\u201d Behavioral and Brain Sciences, vol. 20, pp. 57\u201390, 1997.","journal-title":"Behavioral and Brain Sciences"},{"key":"408587_CR6","unstructured":"H. Curtis, Biology, Worth Publishers, 1983."},{"key":"408587_CR7","doi-asserted-by":"crossref","unstructured":"J. M. Daida, S. P. Yalcin, P. M. Litvak, G. A. Eickhoff, and J. A. Polito, \u201cOf metaphors and Darwinism: Deconstructing genetic Programming's chimera,\u201d in Proc. Congress on Evolutionary Computation, pp. 453\u2013462, 1999.","DOI":"10.1109\/CEC.1999.781959"},{"key":"408587_CR8","unstructured":"D. Dasgupta and D. R. MacGregor, \u201cNonstationary function optimization using the structured genetic algorithm,\u201d in Parallel Problem Solving from Nature 2, R. Manner and B. Manderick (eds.), 1992, pp. 145\u2013154."},{"key":"408587_CR9","unstructured":"L. J. Eshelman, R. A. Caruana, and J. D. Schaffer, \u201cBiases in the crossover landscape,\u201d in Proc. 3rd Int. Conf. Genetic Algorithms, J. D. Schaffer (ed.), 1989, pp. 10\u201319."},{"key":"408587_CR10","unstructured":"R. W. Franceschini, A. S. Wu, and A. Mukherjee, \u201cComputational strategies for disaggregation,\u201d in Proc. 9th Conf. on Computer Generated Forces and Behavioral Representation, 2000."},{"key":"408587_CR11","unstructured":"D. R. Frantz, \u201cNon-linearities in genetic adaptive search,\u201d Ph.D. Thesis, University of Michigan, 1972."},{"key":"408587_CR12","unstructured":"D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, 1989."},{"key":"408587_CR13","unstructured":"D. E. Goldberg, K. Deb, H. Kargupta, and G. Harik, \u201cRapid accurate optimization of difficult problems using fast messy genetic algorithms,\u201d in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest (ed.), 1993, pp. 56\u201364."},{"key":"408587_CR14","first-page":"493","volume":"3","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg, B. Korb, and K. Deb, \u201cMessy genetic algorithms: Motivation, analysis, and first results,\u201d Complelx Systems, vol. 3, no., pp. 493\u2013530, 1989.","journal-title":"Complelx Systems"},{"issue":"4","key":"408587_CR15","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1023\/A:1022677607120","volume":"5","author":"J. Grefenstette","year":"1990","unstructured":"J. Grefenstette, C. L. Ramsey, and A. C. Schultz, \u201cLearning sequential decision rules using simulation models and competition,\u201d Machine Learning, vol. 5, no. 4, pp. 355\u2013381, 1990.","journal-title":"Machine Learning"},{"key":"408587_CR16","unstructured":"G. R. Harik, \u201cLearning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms,\u201d Ph.D. Thesis, University of Michigan, 1997."},{"key":"408587_CR17","unstructured":"J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975."},{"key":"408587_CR18","unstructured":"T. Jones and S. Forrest, \u201cFitness distance correlation as a measure of problem difficulty for genetic algorithms,\u201d in Proc. 6th Int. Conf. Genetic Algorithms, L. J. Eshelman (ed.), 1995."},{"key":"408587_CR19","doi-asserted-by":"crossref","unstructured":"H. Kargupta, \u201cThe gene expression messy genetic algorithm,\u201d in Proc. IEEE Int. Conf. Evolutionary Computation, IEEE Press, 1996, pp. 814\u2013819.","DOI":"10.1109\/ICEC.1996.542706"},{"key":"408587_CR20","unstructured":"H. Kargupta, \u201cA striking property of genetic code-like transformations,\u201d Complex Systems, vol. 11, 2001."},{"issue":"1","key":"408587_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1162\/10636560151075112","volume":"9","author":"H. Kargupta","year":"2001","unstructured":"H. Kargupta and B. H. Park, \u201cGene expression and fast construction of distributed evolutionary representation,\u201d Evolutionary Computation, vol. 9, no. 1, pp. 43\u201369, 2001.","journal-title":"Evolutionary Computation"},{"key":"408587_CR22","unstructured":"R. E. Keller and W. Banzhaf, \u201cEvolution of genetic code in genetic programming,\u201d in Proc. Genetic and Evolutionary Computation Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith (eds.), 1999, pp. 1077\u20131082."},{"key":"408587_CR23","unstructured":"R. E. Keller and W. Banzhaf, \u201cEvolution of genetic code on a hard problem,\u201d in Proc. Genetic and Evolutionary Computation Conf., L. Spector, E. D. Goodman, A. S. Wu, W. B. Langdon, H. M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke (eds.), 2001, pp. 50\u201356."},{"key":"408587_CR24","unstructured":"P. J. Kennedy and T. R. Osborn, \u201cA model of gene expression and regulation in an artificial cellular organism,\u201d Complex Systems, vol. 11, 1997."},{"key":"408587_CR25","unstructured":"J. Lewis, \u201cA comparative study of diploid and haploid binary genetic algorithms,\u201d Master's Thesis, University of Edinburgh, 1997."},{"key":"408587_CR26","doi-asserted-by":"crossref","unstructured":"K. Mathias and L. D. Whitley, \u201cTransforming the search space with gray coding,\u201d in Proc. IEEE Int. Conf. Evolutionary Computation, 1994, pp. 513\u2013518.","DOI":"10.1109\/ICEC.1994.349897"},{"key":"408587_CR27","unstructured":"K. P. Ng and K. C. Wong, \u201cA new diploid scheme and dominance change mechanism for nonstationary function optimization,\u201d in Proc. 6th Int. Conf. Genetic Algorithms, L. J. Eshelman (ed.), 1995."},{"key":"408587_CR28","doi-asserted-by":"crossref","unstructured":"S. Ohno, Evolution by Gene Duplication, Springer-Verlag, 1970.","DOI":"10.1007\/978-3-642-86659-3"},{"key":"408587_CR29","unstructured":"M. O'Neill and C. Ryan, \u201cGrammar based function definition in grammatical evolution,\u201d in Proc. Genetic and Evolutionary Computation Conf., D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer (eds.), 2000, pp. 485\u2013490."},{"key":"408587_CR30","doi-asserted-by":"crossref","unstructured":"M. Shackleton, R. Shipman, and M. Ebner, \u201cAn investigation of redundant genotype-phenotype mappings and their role in evolutionary search,\u201d in Proc. Congress on Evolutionary Computation, 2000, pp. 493\u2013500.","DOI":"10.1109\/CEC.2000.870337"},{"issue":"3","key":"408587_CR31","first-page":"251","volume":"6","author":"R. E. Smith","year":"1992","unstructured":"R. E. Smith and D. E. Goldberg, \u201cDiploidy and dominance in artificial genetic search,\u201d Complex Systems, vol. 6, no. 3, pp. 251\u2013285, 1992.","journal-title":"Complex Systems"},{"key":"408587_CR32","unstructured":"T. Soule and A. E. Ball, \u201cA genetic algorithm with multiple reading frames,\u201d in Proc. Genetic and Evolutionary Computation Conf., L. Spector, E. D. Goodman, A. S. Wu, W. B. Langdon, H. M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke (eds.), 2001, pp. 615\u2013622."},{"key":"408587_CR33","unstructured":"G. Syswerda, \u201cUniform crossover in genetic algorithms,\u201d in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 2\u20139."},{"key":"408587_CR34","unstructured":"V. K. Vassilev and J. F. Miller, \u201cEmbedding landscape neutrality to build a bridge from the conventional to a more efficient three-bit multiplier circuit,\u201d in Proc. Genetic and Evolutionary Computation Conf., D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer (eds.), 2000, p. 539."},{"key":"408587_CR35","unstructured":"J. D. Watson, M. Gilman, J. Witkowski, and M. Zoller, Recombinant DNA, Scientific American Books, 1992."},{"key":"408587_CR36","unstructured":"A. S. Wuand K. A. De Jong, \u201cAn examination of building block dynamics in different representations,\u201d in Proc. Congress on Evolutionary Computation, 1999, pp. 715\u2013721."},{"issue":"2","key":"408587_CR37","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1162\/evco.1996.4.2.169","volume":"4","author":"A. S. Wuand","year":"1996","unstructured":"A. S. Wuand R. K. Lindsay, \u201cA comparison of the fixed and floating building block representation in the genetic algorithm,\u201d Evolutionary Computation, vol. 4, no. 2, pp. 169\u2013193, 1996.","journal-title":"Evolutionary Computation"},{"key":"408587_CR38","unstructured":"A. S. Wu, A. C. Schultz, and A. Agah, \u201cEvolving control for distributed micro air vehicles,\u201d in Proc. IEEE Int. Symp. Computational Intelligence in Robotics and Automation, 1999, pp. 174\u2013179."},{"key":"408587_CR39","unstructured":"K. Yoshida and N. Adachi, \u201cA diploid genetic algorithm for preserving population diversity,\u201d in Parallel Problem Solving from Nature 3, Y. Davidor, H.-P. Schwefel, and R. Manner (eds.), 1994."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015531909333.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015531909333\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015531909333.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:53:00Z","timestamp":1754427180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015531909333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["408587"],"URL":"https:\/\/doi.org\/10.1023\/a:1015531909333","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}