Universal coding algorithm for a family of context Markov sources

Often, for a source to be encoded it is only known (or assumed) that its model belongs to some known family; parameters of models are unknown. The number of context Markov models in a family can be enormous, and methods for finding the best of them to describe a current block (message fragment of length $n$) have not been discussed previously. We propose a way to solve this problem and describe a coding algorithm.