Significantly lower entropy estimates for natural DNA sequences

Journal of Computational Biology

Volumn 6, Issue 1, 1999, Pages 125-142

  Loewenstern, David ^a   Yianilos, Peter N ^a,b  

^a NEC LABORATORIES AMERICA   (United States)

^b Princeton University   (United States)

Author keywords

Context modeling; Data compression; DNA; Entropy; Expectation maximization (EM); Time series prediction

Indexed keywords

ARTICLE; DNA SEQUENCE; ENTROPY; MICROBIOLOGY; MODEL; MOLECULAR RECOGNITION; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL; PROTEIN DOMAIN; STATISTICAL MODEL;

EID: 0032919622     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1999.6.125     Document Type: Article

References (25)

1. Baum, L.E. 1972. An inequality and associated maximization technique in statistical estimatation of probabilistic functions of Markov processes. Inequalities 3, 1-8.
2. Baum, L.E., and Eagon, J.E. 1967. An inequality with application to statistical estimation for probabalistic functions of a Markov process and to models for ecology. Bull. A.M.S. 73, 360-363.
3. Baum, L.E., Petrie, T., Soules, G., and Weiss, N. 1970. A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math Stat. 41, 164-171.
4. Bell, T.C., Cleary, J.G., and Witten, I.H. 1990. Text Compression. Prentice Hall, Englewood Cliffs, NJ.
5. Cardon, L., and Stormo, G. 1992. Expectation maximization algorithm for identifying protein-binding sites with variable lengths from unaligned DNA fragments. J.M.B. 223, 159-170.
6. Cosmi, C., Cuomo, V., Ragosta, M., and Macchiato, M. 1990. Characterization of nucleotidic sequences using maximum entropy techniques. J. Theor. Biol. 147, 423-432.
7. Cover, T.M., and Thomas, J.A. 1991. Elements of Information Theory, Wiley, New York.
8. Dempster, A.P., Laird, N.M., and Rubin, D.B. 1977. Maximum-likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B 39, 1-38.
9. Dujon, B., Alexandraki, D., Andre, B., et al. 1994. Complete DNA sequence of yeast chromosome XI. Nature 369, 371-378.
10. Farach, M., Noordewier, M., Savari, S., Shepp, L., Wyner, A., and Ziv, J. 1995. On the entropy of DNA: algorithms and measurements based on memory and rapid convergence. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM/ACM-SIGACT, San Francisco, pp. 48-57.
11. Gatlin, L.L. 1972. Information Theory and the Living System. Columbia University Press, New York.
12. Grumbach, S., and Tahi, F. 1994. A new challenge for compression algorithms: genetic sequences. Inform. Processing Manage. 30, 875-886.
13. Herzel, H. 1988. Complexity of symbol sequences. Syst. Anal. Mod. Simul. 5, 435-444.
14. Herzel, H., Ebeling, W., and Schmitt, A. 1994. Entropies of biosequences: the role of repeats. Phys. Rev. E 50, 5061-5071.
15. Krogh, A., Mian, I., and Haussler, D. 1994. A hidden Markov model that finds genes in Escheria coli DNA. Nucleic Acids Res. Suppl. 22, 4768-4778.
16. Laplace, P.-S. 1995. Philosophical Essay on Probabilities. 1825. Trans. A.I. Dale. Springer-Verlag, New York.
17. Lauc, G., Ilić, I., and Heffer-Lauc, H. 1992. Entropies of coding and noncoding sequences of DNA and proteins. Biophys. Chem. 42, 7-11.
18. Loewenstern, D., Berman, H., and Hirsh, H. 1997. Maximum a posteriori classification of DNA structure from sequence information. Technical Report DCS-TR-331. Department of Computer Science, Rutgers University.
19. Loewenstern, D., Hirsh, H., Yianilos, P.N., and Noordewier, M. 1995. DNA sequence classification using compression-based induction. Technical Report TR 95-087. DIMACS.
20. Mantegna, R., Buldyrev, S., Goldberger, A., et al. 1993. Linguistic features of noncoding DNA sequences. Phys. Rev. Lett. 73, 3169-3172.
21. Poritz, A.B. 1988. Hidden Markov models: a guided tour, 7-13. In: Proceedings of the ICASSP-88, Volume 1, IEEE, New York.
22. Redner, R.A., and Walker, H.F. 1984. Mixture densities, maximum likelihood, and the EM algorithm. S.I.A.M. Rev. 26, 195-239.
23. Salamon, P., and Konopka, A.K. 1992. A maximum entropy principle for the distribution of local complexity in naturally occurring nucleotide sequences. Comput. Chem. 16, 117-124.
24. Yianilos, P.N. 1997. Topics in Computational Hidden State Modeling. Doctoral dissertation, Department of Computer Science, Princeton University.
25. Ziv, J., and Lempel, A. 1977. A universal algorithm for sequential data compression. I.E.E.E. Trans. Information Theor. IT-23, 3.