Physical Complexity of Symbolic Sequences

Details Physical Complexity of Symbolic Sequences Physical Complexity of Symbolic Sequences

1996-05-29

arxiv.org/abs/adap-org/9605002v3

Physica D 137 (2000) 62-69

Physics

Condensed Matter

Statistical Mechanics

12 pages LaTeX2e, 3 postscript figures, uses elsart.cls. Substantially improved and clarified version, includes application to

Scientific paper

10.1016/S0167-2789(99)00179-7

A practical measure for the complexity of sequences of symbols (``strings'') is introduced that is rooted in automata theory but avoids the problems of Kolmogorov-Chaitin complexity. This physical complexity can be estimated for ensembles of sequences, for which it reverts to the difference between the maximal entropy of the ensemble and the actual entropy given the specific environment within which the sequence is to be interpreted. Thus, the physical complexity measures the amount of information about the environment that is coded in the sequence, and is conditional on such an environment. In practice, an estimate of the complexity of a string can be obtained by counting the number of loci per string that are fixed in the ensemble, while the volatile positions represent, again with respect to the environment, randomness. We apply this measure to tRNA sequence data.

Affiliated with

Also associated with

No associations

Rating

Physical Complexity of Symbolic Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Physical Complexity of Symbolic Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Physical Complexity of Symbolic Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602563