Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence.
Marius ZimandPublished in: STACS (2009)
Keyphrases
- kolmogorov complexity
- inductive inference
- variable length
- finite alphabet
- biological sequences
- hidden markov models
- information sources
- edit distance
- longest common subsequence
- binary strings
- complexity measures
- tree structures
- expert systems
- conditional independence
- string matching
- sequence alignment
- sequential patterns
- neural network