Bibliography

1

N. M. Laird A. P. Dempster and D. B. Rubin.
Maximum likelihood estimation from incomplete data.
Journal of the Royal Statistics Society, 39:1-38, 1977.

2

L. E. Baum.
An inequality and associated maximization technique occuring in the statistical analysis of probabilistic functions of markov chains.
Inequalities, 3:1-8, 1972.

3

R. Bellman.
Dynamic Programming.
Princeton University Press, Boston, 1957.

4

R. Durbin, S. Eddy, A. Krough, and G. Mitchison.
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids.
Cambridge University Press, 1998.

5

A. Krogh, M. Brown, S. Mian, M. Sjölander, and D. Haussler.
Hidden Markov models in computational biology: Applications to protein modeling.
Technical Report UCSC-CRL-93-32, Department of Computer and Information Sciences, University of California at Santa Cruz, 1993.

6

Anders Krogh, I. Saira Mian, and David Haussler.
A hidden markov model that finds genes in E. coli DNA.
Nucleic Acids Research, 22:4768-4778, 1994.

7

D. Kulp, D. Haussler, M.G. Reese, and F.H. Eeckman.
A generalized hidden Markov model for the recognition of human genes in DNA.
In D. J. States, P. Agarwal, T. Gaasterland, L. Hunter, and R. Smith, editors, Proc. Conf. On Intelligent Systems in Molecular Biology '96, pages 134-142. AAAI/MIT Press, 1996.
St. Louis, Mo.

8

Charles E. Lawrence, Stephen F. Altschul, Mark S. Boguski, Jun S. Liu, Andrew F. Neuwald, and John C. Wootton.
Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment.
Science, 262:208-214, 8 October 1993.

9

L. R. Rabiner.
A tutorial on hidden Markov models and selected applications in speech recognition.
Proceedings of the IEEE, 77(2):257-286, February 1989.

10

A. J. Viterbi.
Error bounds for convolutional codes and an asymptotically optimal decoding algorithm.
IEEE Trans. Information Theory, IT-13:260-269, 1967.