DNA computing, computation complexity and problem of biological evolution rate

Acta Biotheoretica

Volumn 56, Issue 4, 2008, Pages 285-295

  Melkikh, Alexey V ^a  

^a URAL FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

Algorithm complexity; Deterministic evolution; DNA computing; No Free Lunch Theorems; Probability of new species origin; Undirected mutations

Indexed keywords

DNA;

ALGORITHM; DNA; EVOLUTIONARY BIOLOGY; MUTATION; NEW SPECIES; PROBABILITY;

ALGORITHM; ARTICLE; BIOLOGY; EVOLUTION; GENETICS; PROBABILITY; THEORETICAL MODEL;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DNA; EVOLUTION; MODELS, THEORETICAL; PROBABILITY;

EID: 57049167550     PISSN: 00015342     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10441-008-9055-8     Document Type: Article

References (28)

1. Abouheif E, Wray GA (2002) Evolution of the gene network underlying wing polyphenism in ants. Science 297(5579):249-252. doi: 10.1126/science.1071468
2. Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 226:1021-1024. doi: 10.1126/science.7973651
3. Ben-Jacob E (1998) Bacterial wisdom, Godel's theorem and creative genomic webs. Physica A 248:57-76. doi: 10.1016/S0378-4371(97)00529-3
4. Cavalli-Sforza LL (2000) Genes, peoples and languages, North Point Press, New York
5. Chaitin GJ (1977) Algorithmic information theory. IBM J Res Develop 21:350-359
6. Coyne JA, Orr HA (1989a) Patterns of speciation in drosophila. Evolution 43(2):362-381. doi: 10.2307/2409213
7. Coyne JA, Orr HA (1989b) The evolutionary genetics of speciation. Philos Trans R Soc Lond B Biol Sci 353:287-305. doi: 10.1098/rstb.1998.0210
8. Cormen T, Leiserson C, Rivest R (2001) Introduction to algorithms. The MIT Press and McGraw-Hill, Cambridge
9. Eigen M, Schuster M (1979) The hypercycle-a principle of natural self-organization. Springer-Verlag, Berlin
10. Ho YC, Pepyne DL (2002) Simple explanation of the No-Free-Lunch Theorem and its implications. J Optim Theory Appl 115:549. doi: 10.1023/A:1021251113462
11. Holland J (1975) Adaptation in natural and artificial systems. The University of Michgan Press, Ann Arbor
12. Honma T, Goto K (2001) Complexes of MADS-box proteins are sufficient to convert leaves into floral organs. Nature 409(6819):525-529. doi: 10.1038/35054083
13. Jiggins CD, Davies N (1993) Genetic evidence for a sibling species of Heliconius charithonia (Lepidoptera; Nymphalidae). Biol J Linn Soc 64:57-67
14. Kolchanov NA, Nedosekina NA, Ananko EA et al (2002) GeneNet database: description and modeling of gene networks. In Silico Biol 2(2):97-110
15. Kolmogorov AN (1963) On tables of random numbers. Sankhya A 25(4):369-376
16. Kolmogorov AN (1968a) Three approaches to the quantitative definition of information. Int J Comput Math 2(1-4):157-168
17. Kolmogorov AN (1968b) Logical basis for information theory and probability theory. IEEE Trans Inf Theory 14(5):662-664
18. Kolmogorov AN (1987) Information theory and theory of algorithms. Nauka, Moscow
19. Koza J (1992) Genetic programming: on the programming of computers by means of natural selection. Mass MIT Press, Cambridge
20. Li M, Vitanyi P (1990) Kolmogorov complexity and its applications/ handbook of theoretical computer science. Elsevier Science Publication
21. Mao W (2003) Modern cryptography: theory and practice. Prentice Hall Professional Technical Reference
22. Marinakis YD (2007) From quasi-organism to protolife. Ecol complexity 4:102-112
23. Melkikh AV (2005a) Deterministic mechanism of molecular evolution. Proceedings of the international moscow conference on computational molecular biology, pp 227-228
24. Melkikh AV (2005b) Could life evolve by random mutations? Biophysics (Biofizika) 50(5):959-960
25. Paun G, Rozenberg G, Salomaa A (1998) DNA computing new computing paradigms. Springer-Verlag, Berlin Heidelberg
26. Shapiro JA (2002) A 21st century view of evolution. J Biol Phys 28:1-20. doi: 10.1023/A:1021207310080
27. Theissen G, Saedler H (2001) Floral quartets. Nature 409(6819):469-471. doi: 10.1038/35054172
28. Wolpert DH, Macready WG (1997) No Free Lunch Theorems for optimization. IEEE Trans Evol Comput 1:67. doi: 10.1109/4235.585893