A computational view of population genetics

Random Structures and Algorithms

Volumn 12, Issue 4, 1998, Pages 313-334

  Rabani, Yuval ^a   Rabinovich, Yuri ^b   Sinclair, Alistair ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032329434     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199807)12:4<313::AID-RSA1>3.0.CO;2-W     Document Type: Article

References (25)

1. M. Atjai, J. Aspnes, M. Naor, Y. Rabani, L. Schulman, and O. Waarts, Fairness in scheduling, Proceedings of the Sixth Annual ACM Symposium on Discrete Algorithms, 1995, pp. 477-485.
2. M. Atjai, J. Komlás, and E. Szemerédi, Deterministic simulation in LOGSPACE, Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, pp. 132-140.
3. S. Arora, Y. Rabani, and U. Vazirani, Simulating quadratic dynamical systems is PSpACE-complete, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994, pp. 459-467.
4. E. B. Baum, D. Boneh, and C. Garrett, On genetic algorithms, Proceedings of the Eighth ACM Workshop on Computational Learning Theory, 1995, pp. 230-239.
5. E. Carlen and M. Carvalho, Strict entropy production bounds and stability of the rate of convergence to equilibrium for the Boltzmann equation, J. Statist. Phys. 67, 575-608 (1992).
6. K. L. Clarkson, D. Eppstein, G. L. Miller, C. Sturtivant, and S. H. Teng, Approximating center points with iterated Radon points, Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, 1993, pp. 91-98.
7. P. Diaconis, Group Representations in Probability and Statistics, Lecture Notes Monograph Series, Institute of Mathematical Statistics, Hayward, CA, 1988, Vol. 11.
8. W. J. Ewens, Mathematical Population Genetics, Lecture Notes in Biomathematics, Springer, Berlin, 1979, Vol. 9.
9. H. Geiringer, On the probability theory of linkage in Mendelian heredity, Ann. Math. Statist. 15, 25-37 (1944).
10. D. Gillman and Y. Rabinovich, Inverse Chernoff bounds, unpublished manuscript, 1995.
11. J. B. S. Haldane, The combination of linkage values and the calculation of distances between the loci of linked factors, J. Genetics 8, 299-309 (1919).
12. M. Hirsch and S. Smale, Differential Equations, Dynamical Systems, and Linear Algebra, Academic Press, New York, 1974.
13. J. Holland, Adaptation in Natural and Artificial Systems, MIT Press, Cambridge, MA 1992.
14. A. Juels, Topics in black-box combinatorial optimization, Ph.D. thesis, Computer Science Division, University of California, Berkeley, 1996.
15. R. Kannan, Markov chains and polynomial time algorithms, Proceedings of the Thirty-Fifth Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 656-671.
16. K. Lange, A stochastic model for genetic linkage equilibrium, Theoret. Population Biol. 44, 129-148 (1993).
17. L. Lovász, Random walks on graphs: A survey, in Combinatorics, Paul Erdös is Eighty, Bolyai Society Math. Studies, D. Miklós, V. T. Sós, and T. Szönyi, Eds., János Bolyai Mathematical Society, Budapest, 1996, Vol. 2, pp. 353-397.
18. Y. Lyubich, Mathematical Structures in Population Genetics, Lecture Notes in Biomathematics, Springer, Berlin, 1992, Vol. 22.
19. M. S. McPeek and T. P. Speed, Modeling interference in genetic recombination, Genetics 139, 1031-1044 (1995).
20. O. Penrose, Foundations of Statistical Mechanics, Pergamon Press, Oxford, 1970.
21. P. Pudlák, Complexity theory and genetics, Proceedings of the Ninth Annual IEEE Symposium on Structure in Complexity Theory, 1994, pp. 383-395.
22. Y. Rabinovich, A. Sinclair, and A. Wigderson, Quadratic dynamical systems, Proceedings of the Thirty-Third Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 304-313, Expanded version in preparation.
23. Y. Rabinovich and A. Wigderson, Analysis of a simple genetic algorithm, Proceedings of the Fourth International Conference on Genetic Algorithms, 1991, pp. 215-221.
24. L. G. Valiant, Short monotone formulae for the majority function, J. Algor. 5, 363-366 (1984).
25. M. R. Jerrum and A. J. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, in Approximation Algorithms for NP-hard problems, D. S. Hochbaum, Ed., PWS Publishing, Boston, 1997, pp. 482-520.