New entropy-based measures of gene significance and epistasis

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

Volumn 2724, Issue , 2003, Pages 1345-1356

  Seo, Dong Il ^a   Kim, Yong Hyuk ^a   Moon, Byung Ro ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248892944     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45110-2_9     Document Type: Article

References (21)

1. D. E. Goldberg. Simple genetic algorithms and the minimal deceptive problem. In Genetic Algorithms and Simulated Annealing, pages 74-88, 1987.
2. J. Horn and D.E. Goldberg. Genetic algorithm difficulty and the modality of fitness landscapes. In Foundations of Genetic Algorithms 3, pages 243-270. 1995.
3. H. Kargupta. Signal-to-noise, crosstalk, and long range problem difficulty in genetic algorithms. In International Conference on Genetic Algorithms, pages 193-200, 1995.
4. J. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, 1975.
5. Y. Davidor. Epistasis variance: Suitability of a representation to genetic algorithms. Complex Systems, 4:369-383, 1990.
6. C.R. Reeves and C.C. Wright. An experimental design perspective on genetic algorithms. In Foundations of Genetic Algorithms 3, pages 7-22. 1995.
7. P. Larranaga and J.A. Lozano. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
8. 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.
9. D.I. Seo and B.R. Moon. A survey on chromosomal structures and operators for exploiting topological linkages of genes. In Genetic and Evolutionary Computation Conference, 2003.
10. C.E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379-423, 623-656, 1948.
11. T. Cover and J. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.
12. D. Chiu, A. Wong, and B. Cheung. Information discovery through hierarchical maximum entropy discretization and synthesis. In Knowledge Discovery in Databases. MIT Press, 1991.
13. S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms 2, pages 109-126. 1993.
14. S.A. Kauffman. Adaptation on rugged fitness landscapes. In D. L. Stein, editor, Lectures in the Sciences of Complexity, pages 527-618. Addison-Wesley, 1989.
15. B. Manderick, M. de Weger, and P. Spiessens. The genetic algorithm and the structure of the fitness landscape. In International Conference on Genetic Algorithms, pages 143-157, 1991.
16. P. Merz and B. Freisleben. On the effectiveness of evolutionary search in high-dimensional NK-landscapes. In IEEE Conference on Evolutionary Computation, pages 741-745, 1998.
17. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
18. 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.
19. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In International Conference on Genetic Algorithms, pages 184-192, 1995.
20. G.A. Croes. A method for solving traveling salesman problems. Operations Research, 6:791-812, 1958.
21. TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.