tailieunhanh - Báo cáo y học: "Three subsets of sequence complexity and their relevance to biopolymeric information"

Tuyển tập các báo cáo nghiên cứu về y học được đăng trên tạp chí y học quốc tế cung cấp cho các bạn kiến thức về ngành y đề tài: Three subsets of sequence complexity and their relevance to biopolymeric information | Theoretical Biology and Medical Modelling BioMed Central Review Open Access Three subsets of sequence complexity and their relevance to biopolymeric information David L Abel1 and JackTTrevors 2 Address director The Gene Emergence Project The Origin-of-Life Foundation Inc. 113 Hedgewood Dr. Greenbelt MD 20770-1610 USA and 2Professor Department of Environmental Biology University of Guelph Rm 3220 Bovey Building Guelph Ontario N1G 2W1 Canada Email David L Abel - life@ Jack TTrevors - jtrevors@ Corresponding author Published II August 2005 Received 23 May 2005 Theoretical Biology and Medical Modelling 2005 2 29 doi 1742-4682-2-AcCepted 1 1 August 2005 29 This article is available from http content 2 1 29 2005 Abel and Trevors licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License http licenses by which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Abstract__ Genetic algorithms instruct sophisticated biological organization. Three qualitative kinds of sequence complexity exist random RSC ordered OSC and functional FSC . FSC alone provides algorithmic instruction. Random and Ordered Sequence Complexities lie at opposite ends of the same bi-directional sequence complexity vector. Randomness in sequence space is defined by a lack of Kolmogorov algorithmic compressibility. A sequence is compressible because it contains redundant order and patterns. Law-like cause-and-effect determinism produces highly compressible order. Such forced ordering precludes both information retention and freedom of selection so critical to algorithmic programming and control. Functional Sequence Complexity requires this added programming dimension of uncoerced selection at successive decision nodes in the string. .