naides
July 25th, 2007, 17:27
A question for the informatics wizards in the audience, regarding a real life project
(I am asking so I don't want to invent the wheel).
I need to find a function evaluates the entropy of an arbitrary, relative short string of letters,
So the string:
AAAAAACCCCCAAAAACCCCRRRRRR
will have lower entropy (repetition) than
ACACACATRETRETRE
and lower than
AVDADSETEWQWML
I know compression rate is a quick and dirty way to estimate entropy,
but is there a more structured algorithm already coded and validated?
(I am asking so I don't want to invent the wheel).
I need to find a function evaluates the entropy of an arbitrary, relative short string of letters,
So the string:
AAAAAACCCCCAAAAACCCCRRRRRR
will have lower entropy (repetition) than
ACACACATRETRETRE
and lower than
AVDADSETEWQWML
I know compression rate is a quick and dirty way to estimate entropy,
but is there a more structured algorithm already coded and validated?