Document Detail


DNA computing, computation complexity and problem of biological evolution rate.
MedLine Citation:
PMID:  18787960     Owner:  NLM     Status:  MEDLINE    
Abstract/OtherAbstract:
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.
Authors:
Alexey V Melkikh
Publication Detail:
Type:  Journal Article     Date:  2008-09-12
Journal Detail:
Title:  Acta biotheoretica     Volume:  56     ISSN:  1572-8358     ISO Abbreviation:  Acta Biotheor.     Publication Date:  2008 Dec 
Date Detail:
Created Date:  2008-11-26     Completed Date:  2009-01-22     Revised Date:  -    
Medline Journal Info:
Nlm Unique ID:  0421520     Medline TA:  Acta Biotheor     Country:  Netherlands    
Other Details:
Languages:  eng     Pagination:  285-95     Citation Subset:  IM    
Affiliation:
Ural State Technical University, 19 Mira St., 620002, Yekaterinburg, Russia. mav@dpt.ustu.ru
Export Citation:
APA/MLA Format     Download EndNote     Download BibTex
MeSH Terms
Descriptor/Qualifier:
Algorithms
Computational Biology*
DNA / genetics*
Evolution*
Models, Theoretical
Probability
Chemical
Reg. No./Substance:
9007-49-2/DNA

From MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine


Previous Document:  Solution structure of tRNAVal from refinement of homology model against residual dipolar coupling an...
Next Document:  Overexpression of CyclinD1 and underexpression of p16 correlate with lymph node metastases in laryng...