A survey on chromosomal structures and operators for exploiting topological linkages of genes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2724, Issue , 2003, Pages 1357-1368

  Seo, Dong Il ^a   Moon, Byung Ro ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750277870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45110-2_10     Document Type: Review

References (47)

1. J. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, 1975.
2. D.E. Goldberg. Genetic Algorithms in Search, Optimization, Machine Learning. Addison-Wesley, 1989.
3. J. Cohoon and D. Paris. Genetic placement. In IEEE International Conference on Computer-Aided Design, pages 422-425, 1986.
4. C. Anderson, K. Jones, and J. Ryan. A two-dimensional genetic algorithm for the Ising problem. Complex Systems, 5:327-333, 1991.
5. A.B. Kahng and B.R. Moon. Toward more powerful recombinations. In International Conference on Genetic Algorithms, pages 96-103, 1995.
6. S. Jung and B.R. Moon. Toward minimal restriction of genetic encoding and crossovers for the 2D Euclidean TSP. IEEE Transactions on Evolutionary Computation, 6(6):557-565, 2002.
7. D.I. Seo and B.R. Moon. Voronoi quantized crossover for traveling salesman problem. In Genetic and Evolutionary Computation Conference, pages 544-552, 2002.
8. Y. Davidor. Epistasis variance: Suitability of a representation to genetic algorithms. Complex Systems, 4:369-383, 1990.
9. D.I. Seo, Y.H. Kim, and B.R. Moon. New entropy-based measures of gene significance and epistasis. In Genetic and Evolutionary Computation Conference, 2003.
10. D. Thierens and D.E. Goldberg. Mixing in genetic algorithms. In International Conference on Genetic Algorithms, pages 38-45, 1993.
11. P. Larrañaga and J.A. Lozano. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
12. M. Pelikan, D.E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002.
13. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. In Foundations of Computer Science, pages 577-591, 1994.
14. J.D. Bagley. The Behavior of Adaptive Systems which Employ Genetic and Correlation Algorithms. PhD thesis, University of Michigan, 1967.
15. D.E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):493-530, 1989.
16. D.E. Goldberg, K. Deb, and B. Korb. Messy genetic algorithms revisited: Studies in mixed size and scale. Complex Systems, 4:415-444, 1990.
17. J.R. Levenick. Inserting introns improves genetic algorithm success rate: Taking a cue from biology. In International Conference on Genetic Algorithms, pages 123-127, 1991.
18. D.E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In International Conference on Genetic Algorithms, pages 56-64, 1993.
19. T.N. Bui and B.R. Moon. Hyperplane synthesis for genetic algorithms. In International Conference on Genetic Algorithms, pages 102-109, 1993.
20. T.N. Bui and B.R. Moon. Genetic algorithm and graph partitioning. IEEE Transactions on Computers, 45(7):841-855, 1996.
21. T.N. Bui and B.R. Moon. Analyzing hyperplane synthesis in genetic algorithms using clustered schemata. In Parallel Problem Solving from Nature, pages 108-118. 1994.
22. T.N. Bui and B.R. Moon. A new genetic approach for the traveling salesman problem. In IEEE Conference on Evolutionary Computation, pages 7-12, 1994.
23. A.S. Wu, R.K. Lindsay, and M.D. Smith. Studies on the effect of non-coding segments on the genetic algorithm. In IEEE Conference on Tools with Artificial Intelligence, pages 744-747, 1994.
24. A.S. Wu and R.K. Lindsay. Empirical studies of the genetic algorithm with noncoding segments. Evolutionary Computation, 3(2):121-147, 1995.
25. J.R. Levenick. Metabits: Generic endogenous crossover control. In International Conference on Genetic Algorithms, pages 88-95, 1995.
26. H. Kargupta. The gene expression messy genetic algorithm. In IEEE Conference on Evolutionary Computation, pages 814-819, 1996.
27. T.N. Bui and B.R. Moon. GRCA: A hybrid genetic algorithm for circuit ratio-cut partitioning. IEEE Transactions on CAD, 17(3):193-204, 1998.
28. J.R. Levenick. Swappers: Introns promote flexibility, diversity and invention. In Genetic and Evolutionary Computation Conference, pages 361-368, 1999.
29. D. Knjazew and D.E. Goldberg. OMEGA - Ordering messy GA: Solving permutation problems with the fast messy genetic algorithm and random keys. In Genetic and Evolutionary Computation Conference, pages 181-188, 2000.
30. Y.K. Kwon, S.D. Hong, and B.R. Moon. A genetic hybrid for critical heat flux function approximation. In Genetic and Evolutionary Computation Conference, pages 1119-1125, 2002.
31. G.R. Harik and D.E. Goldberg. Learning linkage. In Foundations of Genetic Algorithms 4, pages 247-262. 1996.
32. G.R. Harik. Learning Gene Linkage to Efficiently Solve Problems of Bounded Difficulty Using Genetic Algorithms. PhD thesis, University of Michigan, 1997.
33. F.G. Lobo, K. Deb, and D.E. Goldberg. Compressed introns in a linkage learning genetic algorithm. In Third Annual Conference on Genetic Programming, pages 551-558, 1998.
34. G.R. Harik and D.E. Goldberg. Learning linkage through probabilistic expression. Computer Methods in Applied Mechanics and Engineering, 186:295-310, 2000.
35. Y.P. Chen and D.E. Goldberg. Introducing start expression genes to the linkage learning genetic algorithm. Technical Report 2002007, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, 2002.
36. T.N. Bui and B.R. Moon. On multi-dimensional encoding/crossover. In International Conference on Genetic Algorithms, pages 49-56, 1995.
37. B.R. Moon and C.K. Kim. A two-dimensional embedding of graphs for genetic algorithms. In International Conference on Genetic Algorithms, pages 204-211, 1997.
38. B.R. Moon, Y.S. Lee, and C.K. Kim. GEORG: VLSI circuit partitioner with a new genetic algorithm framework. Journal of Intelligent Manufacturing, 9(5):401-412, 1998.
39. B.R. Moon and C.K. Kim. Dynamic embedding for genetic VLSI circuit partitioning. Engineering Applications of Artificial Intelligence, 11:67-76, 1998.
40. J.H. Kim and B.R. Moon. Neuron reordering for better neuro-genetic hybrids. In Genetic and Evolutionary Computation Conference, pages 407-414, 2002.
41. C.Y. Lee and E.K. Antonsson. Adaptive evolvability via non-coding segment induced linkage. In Genetic and Evolutionary Computation Conference, pages 448-453, 2001.
42. S. Jung and B.R. Moon. The natural crossover for the 2D Euclidean TSP. In Genetic and Evolutionary Computation Conference, pages 1003-1010, 2000.
43. S. Jung and B.R. Moon. A hybrid genetic algorithm for the vehicle routing problem with time windows. In Genetic and Evolutionary Computation Conference, pages 1309-1316, 2002.
44. W.A. Greene. A genetic algorithm with self-distancing bits but no overt linkage. In Genetic and Evolutionary Computation Conference, pages 367-374, 2002.
45. D.I. Seo and B.R. Moon. A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem. In Genetic and Evolutionary Computation Conference, 2003.
46. E.J. Park, Y.H. Kim, and B.R. Moon. Genetic search for fixed channel assignment problem with limited bandwidth. In Genetic and Evolutionary Computation Conference, pages 1172-1179, 2002.
47. A.S. Wu and R.K. Lindsay. A survey of intron research in genetics. In Parallel Problem Solving from Nature, pages 101-110, 1996.