A computational view of population genetics

✍ Scribed by Yuval Rabani; Yuri Rabinovich; Alistair Sinclair

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 244 KB
• Volume: 12
• Category: Article
• ISSN: 1042-9832
• DOI: 10.1002/(sici)1098-2418(199807)12:4<313::aid-rsa1>3.0.co;2-w

✦ Synopsis

This paper contributes to the study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear Ž . counterparts such as Markov chains , which have had a wide impact in computer science, and they seem likely to play an increasing role in the future. However, there are as yet no general techniques available for handling the computational aspects of discrete nonlinear systems, and even the simplest examples seem very hard to analyze. We focus in this paper on a class of quadratic systems that are widely used as a model in population genetics and also in genetic algorithms. These systems describe a process where random matings occur between parental chromosomes via a mechanism known as ''crossover'': i.e., children inherit pieces of genetic material from different parents according to some random rule. Our