Uniform Accuracy of the Maximum Likelihood Estimates for Probabilistic Models of Biological Sequences
- 80 Downloads
Probabilistic models for biological sequences (DNA and proteins) have many useful applications in bioinformatics. Normally, the values of parameters of these models have to be estimated from empirical data. However, even for the most common estimates, the maximum likelihood (ML) estimates, properties have not been completely explored. Here we assess the uniform accuracy of the ML estimates for models of several types: the independence model, the Markov chain and the hidden Markov model (HMM). Particularly, we derive rates of decay of the maximum estimation error by employing the measure concentration as well as the Gaussian approximation, and compare these rates.
KeywordsMaximum likelihood estimate Asymptotic properties of estimates Hidden Markov model Concentration of measure
AMS 2000 Subject Classifications62M05 60J10 62F10 11L07
Unable to display preview. Download preview PDF.
- Borodovsky MY, Sprizhitsky YA, Golovanov EI, Alexandrov AA (1986a) Statistical patterns in the primary structure of the functional regions of the Escherichia coli genome. I. Frequency characteristics. Mol Biol 20:826–833 (English translation)Google Scholar
- Borodovsky MY, Sprizhitsky YA, Golovanov EI, Alexandrov AA (1986b) Statistical patterns in the primary structure of the functional regions of the Escherichia coli genome. II. Nonuniform Markov models. Mol Biol 20:833–840 (English translation)Google Scholar
- Ekisheva S, Borodovsky M (2006) Probabilistic models for biological sequences: selection and maximum likelihood estimation. Int J Bioinformatics Res Appl 2:305–324Google Scholar
- Gatlin LL (1972) Information theory and the living system. Columbia University Press, New YorkGoogle Scholar
- Gudynas P (2000) Refinements of the central limit theorem for homogeneous Markov chains. In: Prokhorov YV, Statulevičius V (eds) Limit theorems of probability theory. Springer, Berlin, pp 167–183Google Scholar
- McDiarmid C (1998) Concentration. In: Probabilistic methods for algorithmic discrete mathematics. Algorithms in combinatorics, vol 16. Springer, Berlin, pp 195–248Google Scholar
- Montenegro R, Tetali P (2006) Mathematical aspects of mixing times in Markov chains. In: Sudan M (ed) Book in series foundations and trends in theoretical computer science, vol 1:3. NOW, BostonGoogle Scholar
- Saulis L, Statulevičius VA (2000) Limit theorems on large deviations. In: Prokhorov YV, Statulevičius V (eds) Limit theorems of probability theory. Springer, Berlin, pp 185–266Google Scholar