变长符号序列的物理复杂性
Physical Complexity of Variable Length Symbolic Sequences
摘要:
基于统计物理学、自动机理论和信息论,建立了一个称为物理复杂性的度量,并计算了序列的总体。它是生物体基因组中信息量的量度。它是基于香农熵,测量在其环境中进化的种群中的信息,通过使用熵来估计基因组中的随机性。它是根据种群的最大熵和种群在其环境中的实际熵之间的差异计算的,通过计算种群序列中固定位点的数量来估计。到目前为止,物理复杂性仅针对具有相同长度的序列的群体而制定。在这里,我们调查的扩展,以支持可变长度的人口。然后,我们以此为基础,构建一个衡量信息存储效率的指标,我们后来使用它来理解群体内的聚类。最后,我们通过模拟研究了我们的扩展物理复杂性,表明它与原来的一致。
英文摘要:
A measure called Physical Complexity is established and calculated for a population of sequences, based on statistical physics, automata theory, and information theory. It is a measure of the quantity of information in an organism's genome. It is based on Shannon's entropy, measuring the information in a population evolved in its environment, by using entropy to estimate the randomness in the genome. It is calculated from the difference between the maximal entropy of the population and the actual entropy of the population when in its environment, estimated by counting the number of fixed loci in the sequences of a population. Up to now, Physical Complexity has only been formulated for populations of sequences with the same length. Here, we investigate an extension to support variable length populations. We then build upon this to construct a measure for the efficiency of information storage, which we later use in understanding clustering within populations. Finally, we investigate our extended Physical Complexity through simulations, showing it to be consistent with the original.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。