DNA Computing, Computation Complexity and Problem of Biological Evolution Rate / Melkikh Alexey V. // ACTA BIOTHEORETICA. - 2008. - V. 56, l. 4. - P. 285-295.

ISSN/EISSN:

0001-5342 / нет данных

Type:

Article

Abstract:

An analogy between the evolution of organisms and some complex computational problems (cryptosystem cracking, determination of the shortest path in a graph) is considered. It is shown that in the absence of a priori information about possible species of organisms such a problem is complex (is rated in the class NP) and cannot be solved in a polynomial number of steps. This conclusion suggests the need for re-examination of evolution mechanisms. Ideas of a deterministic approach to the evolution are discussed.

Author keywords:

DNA computing; Undirected mutations; Algorithm complexity; Deterministic evolution; Probability of new species origin; No Free Lunch Theorems INFORMATION-THEORY; SPECIATION; THEOREM

DOI:

10.1007/s10441-008-9055-8

Web of Science ID:

ISI:000261177200003

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	DEC
Publisher	SPRINGER
Address	VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
Language	English
Keywords-Plus	INFORMATION-THEORY; SPECIATION; THEOREM
Research-Areas	Mathematical \& Computational Biology
Web-of-Science-Categories	Mathematical \& Computational Biology
Author-Email	mav@dpt.ustu.ru
Number-of-Cited-References	28
Usage-Count-Since-2013	2
Journal-ISO	Acta Biotheor.
Doc-Delivery-Number	376IL