skip to main content
review-article
Free Access

Sex as an algorithm: the theory of evolution under the lens of computation

Published:28 October 2016Publication History
Skip Abstract Section

Abstract

Looking at the mysteries of evolution from a computer science point of view yields some unexpected insights.

Skip Supplemental Material Section

Supplemental Material

References

  1. Aldous, D. and Vazirani, U. 'Go with the winners' algorithms. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (1994). 492--501. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Arora, S., Hazan, E. and Kale, S. The multiplicative weights update method: A meta-algorithm and applications. Theory of Computing 8, 1 (2012), 121--164.Google ScholarGoogle ScholarCross RefCross Ref
  3. Athreya, K. and Ney, P. Branching Processes. Springer, 1972.Google ScholarGoogle ScholarCross RefCross Ref
  4. Babbage, C. The Ninth Bridgewater Treatise. 2nd edn. John Murray, London, 1838.Google ScholarGoogle Scholar
  5. Barton, N.H., Novak, S. and Paixão, T. Diverse forms of selection in evolution and computer science. In Proceedings of the National Academy of Sciences 111, 29 (2014), 10398--10399.Google ScholarGoogle ScholarCross RefCross Ref
  6. Bell, G. The Masterpiece of Nature: The Evolution and Genetics of Sexuality. University of California Press, Berkeley, CA, 1982.Google ScholarGoogle Scholar
  7. Chastain, E., Livnat, A., Papadimitriou, C. and Vazirani, U. Algorithms, games, and evolution. In Proceedings of the National Academy of Sciences 111, 29 (2014), 10620--10623.Google ScholarGoogle ScholarCross RefCross Ref
  8. Darwin, C. On the Origin of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life. Murray, London, 1859.Google ScholarGoogle Scholar
  9. Feldman, M.W. Otto, P. and Christiansen, F.B. Population genetic perspectives on the evolution of recombination. Annual Review of Genetics 30 (1997), 261--295.Google ScholarGoogle ScholarCross RefCross Ref
  10. Fisher, R.A. The Genetical Theory of Natural Selection. The Clarendon Press, Oxford, U.K., 1930.Google ScholarGoogle Scholar
  11. Fryxell, K.J. and Moon, W.-J. CpG mutation rates in the human genome are highly dependent on local GC content. Molecular Biology and Evolution 22 (2005), 650--658.Google ScholarGoogle ScholarCross RefCross Ref
  12. Goldberg, D. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Graur, D. and Li, W.-H. Fundamentals of Molecular Evolution. Sinauer Associates, Sunderland, MA, 2000.Google ScholarGoogle Scholar
  14. Holland, J.H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. U Michigan Press, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Johnson, D.S., Papadimitriou, C.H., and Yannakakis, M. How easy is local search? J. Computer and System Sciences 37, 1 (1988), 79--100. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Jong, K.A.D. Evolutionary Computation: A Unified Approach. MIT Press, Cambridge MA, 2006.Google ScholarGoogle Scholar
  17. Kanade, V. Evolution with recombination. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, (2011), 837--846. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Kearns, M. Efficient noise-tolerant learning from statistical queries. J. ACM 45, 6 (1998), 983--1006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Kimura, M. and Ohta, T. The average number of generations until fixation of a mutant gene in a finite population. Genetics 61, 3 (1969), 763.Google ScholarGoogle Scholar
  20. Kirkpatrick, S., Gelatt, Jr, C.D. and Vecchi, M.P. Optimization by simulated annealing. Science 220 (1983), 671--680.Google ScholarGoogle ScholarCross RefCross Ref
  21. Lewontin, R.C. and Hubby, J.L. A molecular approach to the study of genic heterozygosity in natural populations; amount of variation and degree of heterozygosity in natural populations of Drosophila pseudoobscura. Genetics 54 (1966), 595--609.Google ScholarGoogle Scholar
  22. Livnat, A. Interaction-based evolution: How natural selection and nonrandom mutation work together. Biology Direct 8, 1 (2013), 24.Google ScholarGoogle ScholarCross RefCross Ref
  23. Livnat, A., Feldman, M.W., Papadimitriou, C. and Pippenger, N. On the advantage to sexual species in diversification rates. Unpublished manuscript.Google ScholarGoogle Scholar
  24. Livnat, A., Papadimitriou, C., Dushoff, J. and Feldman, M.W. A mixability theory for the role of sex in evolution. In Proceedings of the National Academy of Sciences 105, 50 (2008), 19803--19808.Google ScholarGoogle ScholarCross RefCross Ref
  25. Livnat, A., Papadimitriou, C. and Feldman, M.W. An analytical contrast between fitness maximization and selection for mixability. J. Theoretical Biology 273, 1 (2011), 232--234.Google ScholarGoogle ScholarCross RefCross Ref
  26. Livnat, A., Papadimitriou, C., Pippenger, N. and Feldman, M.W. Sex, mixability, and modularity. In Proceedings of the National Academy of Sciences 107, 4 (2010), 1452--1457.Google ScholarGoogle ScholarCross RefCross Ref
  27. Lynch, V.J., Leclerc, R.D., May, G. and Wagner, G.P. Transposon-mediated rewiring of gene regulatory networks contributed to the evolution of pregnancy in mammals. Nature Genetics 43 (2011), 1154--1159.Google ScholarGoogle ScholarCross RefCross Ref
  28. Mitchell, M. An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Motwani, R. and Raghavan, P. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Nagylaki, T., Hofbauer, J. and Brunovský, P. Convergence of multilocus systems under weak epistasis or weak selection. J. Mathematical Biology 38, 2 (1999), 103--133.Google ScholarGoogle ScholarCross RefCross Ref
  31. Nevo, E., Beiles, A. and Ben-Shlomo, R. The evolutionary significance of genetic diversity: Ecological, demographic and life history correlates. Lecture Notes in Biomathematics 53 (1984), 13--213.Google ScholarGoogle ScholarCross RefCross Ref
  32. Papadimitriou, C. and Steiglitz, K. Combinatorial Optimization: Algorithms and Complexity. Dover, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Rabani, Y. Rabinovich, Y. and Sinclair, A. A computational view of population genetics. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, (1995), 83--92. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Stearns, S.C. and Hoekstra, R.F. Evolution: An Introduction. Oxford University Press, New York, 2005.Google ScholarGoogle Scholar
  35. Valiant, L. Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World. Basic Books, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Valiant, L.G. Evolvability. J. ACM 56, 1 (2009), 3. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Von Neumann, J. and A. W. Burks, A.W. Theory of self-reproducing automata. IEEE Transactions on Neural Networks 5, 1 (1966), 3--14.Google ScholarGoogle Scholar
  38. Williams, G.C. Adaptation and Natural Selection, 8th edition. Princeton University Press, 1996.Google ScholarGoogle Scholar
  39. Wright, S. Evolution in Mendelian populations. Genetics 16 (1931), 97--159.Google ScholarGoogle ScholarCross RefCross Ref
  40. Wright, S. The distribution of gene frequencies in populations. In Proceedings of the National Academy of Sciences of the United States of America, 23, 6 (1937), 307--320.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Sex as an algorithm: the theory of evolution under the lens of computation

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 59, Issue 11
          November 2016
          118 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/3013530
          • Editor:
          • Moshe Y. Vardi
          Issue’s Table of Contents

          Copyright © 2016 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 28 October 2016

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • review-article
          • Popular
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format