A global compositional complexity measure for biological sequences: AT-rich and GC-rich genomes encode less complex proteins

Computers and Chemistry

Volumn 24, Issue 1, 2000, Pages 71-94

  Wan, Honghui ^a   Wootton, John C ^a  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

AT rich; Biological sequences; GC rich

Indexed keywords

DNA; PROTEIN;

ALGORITHM; ARTICLE; CHEMISTRY; COMPUTER SIMULATION; GENOME; MOLECULAR EVOLUTION;

ALGORITHMS; COMPUTER SIMULATION; DNA; EVOLUTION, MOLECULAR; GENOME; PROTEINS;

EID: 0033630767     PISSN: 00978485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8485(00)80008-X     Document Type: Article

References (92)

1. Allison, L., Edgoose, T., Dix, T.I., 1998. Compression of strings with approximate repeats. The Sixth International Conference on intelligent Systems for Molecular Biology (ISMB-98), 8-16.
2. Altschul, S.F., Boguski, M.S., Gish, W., Wootton, J.C., 1994. Issues in searching molecular sequence databases. Nat. Genet. 6, 119-129.
3. Anufrieva, E.V., Bychkova, V.E., Krakovyak, M.G., Pautov, V.D., Ptitsyn, O.B., 1975. A synthetic polypeptide with a compact structure and its self-organization. FEBS Lett. 55, 46-49.
4. Belozersky, A.N., Spirin, A.S., 1958. A correlation between the compositions of deoxyribonucleic and ribonucleic acids. Nature 182, 111-112.
5. Bernardi, G., Olofsson, B., Filipski, J., Zerial, M., Salinas, J., Cuny, G., Meunier-Rotival, M., Rodier, F., 1985. The mosaic genome of warm-blooded vertebrates. Science 228, 953-958.
6. Bork, P., Koonin, E.V., 1998. Predicting functions from protein sequences - where are the bottlenecks? Nat. Genet. 18, 313-318.
7. Boulton, D.M., Wallace, C.S., 1969. The information content of a multistate distribution. J. Theor. Biol. 23, 269-278.
8. Brillouin, L., 1962. Science and Information Theory, 2nd ed. Academic Press, New York.
9. Bryngelson, J.B., Wolynes, P.G., 1987. Spin glasses and the statistical mechanics of protein folding. Proc. Natl. Acad. Sci. USA 84, 7524-7528.
10. Chaitin, G.J., 1966. On the length of programs for computing finite binary sequences. J. Assoc. Comput. Mach. 13, 547-569.
11. Chaitin, G.J., 1987. Algorithmic Information Theory. Cambridge Tracts in Theoretical Computer Science, vol. 1. Cambridge University Press, Cambridge.
12. Cox, E.C., Yanofsky, C., 1967. Altered base ratios in the DNA of an Escherichia coli mutator strain. Proc. Natl. Acad. Sci. USA 58, 1895-1902.
13. Cox, E.C., Yanofsky, C., 1969. Mutator gene studies in Escherichia coli. J. Bacteriol. 100, 390-397.
14. Csiszar, I., Korner, J., 1981. Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, New York, pp. 52-53.
15. Derrida, B., 1981. Random-energy model: an exactly solvable model of disordered systems. Phys. Rev. B 24, 2613-2626.
16. D'Onofrio, G., Mouchiroud, D., Aissani, B., Gautier, C., Bernardi, G., 1991. Correlations between the compositional properties of human genes, codon usage, and amino acid composition of proteins. J. Mol. Evol. 32, 504-510.
17. Doolittle, R.F., 1998. Microbial genomes opened up. Nature 392, 339-342.
18. Faddeev, D.K., 1956. On the concept of entropy of a finite probabilistic scheme. Usp. Mat. Ces. Nauk. (New Series) 11, 227-231.
19. Farach, M., Noordewier, M., Savari, S., Shepp, L., Syner, A., Ziv, J., 1995. On the entropy of DNA: algorithms and measurements based on memory and rapid convergence. Proceedings of the 6th ACM-SIAM Sympsosium on Discrete Algorithms, ACM, Inc., New York, pp. 48-57.
20. Feng, D.F., Doolittle, R.F., 1997. Converting amino acid alignment scores into measures of evolutionary time: a simulation study of various relationships. J. Mol. Evol. 44, 361-370.
21. Finkelstein, A.V., 1994. Implications of the random characteristics of protein sequences for their three-dimensional structure. Curr. Opin. Struct. Biol. 4, 422-428.
22. Freese, E., 1962. On the evolution of base composition of DNA. J. Theor. Biol. 3, 82-101.
23. Gojobori, T., Ishii, K., Nei, M., 1982. Estimation of average number of substitutions when the rate of substitution varies with nucleotide. J. Mol. Evol. 18, 414-423.
24. Gu, X., Li, W.H., 1998. Estimation of evolutionary distances under stationary and non-stationary models of nucleotide substitution. Proc. Natl. Acad. Sci. USA 95, 5899-5905.
25. Gusev, V.D., Kulichkov, V.A., Chupakhina, O.M., 1993. The Lempel-Ziv complexity and local structure analysis of genomes. Biosystems 30, 183-200.
26. Hardy, G.H., Littlewood, J.E., Polya, G., 1952. Inequalities. Cambridge University Press, London.
27. Hardy, G.H., Wright, E.M., 1938. An Introduction to the Theory of Numbers. Oxford Press, London.
28. Huynen, M.A., Bork, P., 1998. Measuring genome evolution. Proc. Natl. Acad. Sci. USA 95, 5849-5856.
29. Ingarden, R.S., Urbanik, K., 1962. Information without probability. Colloq. Math. 9, 131-150.
30. Ikemura, T., 1985. Codon usage and tRNA content in unicellular and multicellular organisms. Mol. Biol. Evol. 2, 13-34.
31. Jukes, T.H., Bhushan, V., 1986. Silent nucleotide substitutions and G + C content of some mitochondrial and bacterial genes. J. Mol. Evol. 24, 39-44.
32. Karlin, S., Altschul, S.F., 1990. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proc. Natl. Acad. Sci. USA 87, 2264-2268.
33. Karlin, S., Brendel, V., 1993. Patchiness and correlations in DNA sequences. Science 259, 677-680.
34. Kimura, M., 1981. Estimation of evolutionary distances between homologous nucleotide sequences. Proc. Natl. Acad. Sci. USA 78, 454-458.
35. Konopka, A.K., 1994. Sequences and codes: fundamentals of biomolecular cryptology. In: Smith, D.W. (Ed.), Biocomputing: Informatics and Genome Projects. Academic Press, New York, pp. 119-174.
36. Konopka, A.K., Owens, J., 1990a. Non-continuous patterns and compositional complexity of nucleic acid sequences. In: Bell, G.I., Marr, T. (Eds.), Computer and DNA. Addison-Wesley, Rosewood City, CA, pp. 147-155.
37. Konopka, A.K., Owens, J., 1990b. Complexity charts can be used to map functional domain in DNA. Genet. Anal.: Tech. Appl. 7, 35-38.
38. Kolmogorov, A.N., 1965. Three approaches to the quantitative definition of information. Probl. Inf. Transm. 1, 1-7.
39. Kullback, S., 1959. Information Theory and Statistics. Wiley, New York.
40. Lee, K.Y., Wahl, R., Barbu, E., 1956. Contenu en bases puriques et pyrimidiques des acids desoxyribonucleiques des bacteries. Ann. l'Institut Pasteur 91, 212-224.
41. Li, M., Vitanyi, P., 1993. Introduction to Kolmogorov Complexity. Springer, New York.
42. Lichtenberg, A.J., Lieberman, M.A., 1992. Regular and Chaotic Dynamics, 2nd ed. Springer, New York.
43. Loewenstern, D., Yianilos, P.N., 1999. Significantly lower entropy estimates for natural DNA sequences. J. Comput. Biol. 6, 125-142.
44. Margalef, D.R., 1958. Information theory in ecology. Gen. Sys. 3, 36-71.
45. Milosavljevic, A., Jurka, J., 1993. Discovering simple DNA sequences by the algorithmic significance method. Comput. Appl. Biosci. 9, 407-411.
46. Muto, A., Osawa, S., 1987. The guanine and cytosine content of genomic DNA and bacterial evolution. Proc. Natl. Acad. Sci. USA 84, 166-169.
47. Neuwald, A.F., Liu, J.S., Lawrence, C.E., 1995. Gibbs motif sampling: detection of bacterial outer membrane protein repeats. Protein Sci. 4, 1618-1632.
48. Plaxco, K.W., Riddle, D.S., Grantcharova, V., Baker, D., 1998. Simplified proteins: minimalist solutions to the 'protein folding problem'. Curr. Opin. Struct. Biol. 8, 80-85.
49. Ptitsyn, O.B., 1983. Protein as an 'edited' statistical copolymer? In: Srinivasanm, S., Sarma, R.M. (Eds.), Conformation in Biology. Academic Press, New York, pp. 49-58.
50. Ptitsyn, O.B., 1995. Molten globule and protein folding. Adv. Protein Chem. 47, 83-229.
51. Regan, L., 1997. Proteins to order? Structure 6, 1-4.
52. Renyi, A. 1961. On measures of entropy and information. Proceedings of the 4th Berkely Symposia in Mathematical Statistics and Probability, Vol. I. University of California Press, Berkeley, CA, pp. 547-561.
53. Renyi, A., 1965. On the foundations of information theory. Rev. l'Institut Int. Stat. 33, 1-14.
54. Riddle, D.S., Santiago, J.V., Bray-Hall, S.T., Doshi, N., Grantcharova, V.P., Yi, Q., Baker, D., 1997. Functional rapidly folding proteins from simplified amino acid sequences. Nat. Struct. Biol. 4, 805-809.
55. Rivals, E., Dauchet, M. 1997. Fast discerning repeats in DNA sequences with a compression algorithm. Genome Informatics Workshop, Tokyo, pp. 215-226.
56. Rolfe, R., Meselson, M., 1959. The relative homogeneity of microbial DNA. Proc. Natl. Acad. Sci. USA 45, 1039-1043.
57. Saccone, C., Lanave, C., Pesole, G., 1993. Time and Biosequences. J. Mol. Evol. 37, 154-159.
58. Salamon, P., Konopka, A.K., 1992. A maximum entropy principle for distribution of local complexity in naturally occurring nucleotide sequences. Comput. Chem. 16, 117-124.
59. Salamon, P., Wootton, J.C., Konopka, A.K., Hansen, L.K., 1993. On the robustness of maximum entropy relationships for complexity distributions of nucleotide sequences. Comput. Chem. 17, 135-148.
60. Segal, I.E., 1960. A note on the concept of entropy. J. Math. Mech. 9, 623-629.
61. Shakhnovich, E.I., Gutin, A.M., 1989. Formation of unique structure in polypeptide chains: Theoretical investigation with the aid of a replica approach. Biophys. Chem. 34, 187-199.
62. Shannon, C.E., 1948. A mathematical theory of communication. Bell Syst. Tech. J. 27, 379-423, 623-656.
63. Shields, P.C., 1996. The Ergodic Theory of Discrete Sample Paths. Graduate Studies in Mathematics, vol. 13. American Mathematical Society, Providence, RI.
64. Solomonoff, R.J., 1964a. A formal theory of inductive inference. I. Inf. Control 7, 1-22.
65. Solomonoff, R.J., 1964b. A formal theory of inductive inference. II. Inf. Control 7, 224-254.
66. Staden, R., 1984. Graphic methods to determine the function of nucleic acid sequences. Nucleic Acids Res. 12, 521-538.
67. Sueoka, N., 1959. A statistical analysis of deoxyribonucleic acid distribution in density gradient centrifugation. Proc. Natl. Acad. Sci. USA 45, 1480-1490.
68. Sueoka, N., 1961. Compositional correlation between deoxyribonucleic acid and protein. Cold Spring Harbor Symp. Quant. Biol. 26, 35-43.
69. Sueoka, N., 1962. On the genetic basis of variation and heterogeneity of DNA base composition. Proc. Natl. Acad. Sci. USA 48, 582-592.
70. Sueoka, N., 1988. Directional mutation pressure and neutral molecular evolution. Proc. Natl. Acad. Sci. USA 85, 2653-2657.
71. Sueoka, N., 1992. Directional mutation pressure, selective constraints, and genetic equilibria. J. Mol. Evol. 34, 95-114.
72. Sueoka, N., 1993. Directional mutation pressure, mutator mutations, and dynamics of molecular evolution. J. Mol. Evol. 37, 137-153.
73. Tajima, F., 1993. Unbiased estimation of evolutionary distance between nucleotide sequences. Mol. Biol. Evol. 10, 677-688.
74. Tamura, K., 1992. Estimation of the number of nucleotide substitutions when there are strong transition-transversion and G + C content biases. Mol. Biol. Evol. 9, 678-687.
75. Thorne, J.L., Kishino, H., 1992. Freeing phylogenies from artifacts of alignment. Mol. Biol. Evol. 9, 1148-1162.
76. Trifonov, E.N., 1990. Making sense of the human genome. Human Genome Initiative and DNA Recombination, vol. 1, Adenine Press, New York.
77. Wallace, C.S., Boulton, D.M., 1968. An information measure for classification. Comput. J. 11, 185-194.
78. Wan, H., 1984a. Structure and cardinality of the class A(R, S) of (0, 1)-matrices. J. Math. Res. Expo. 4, 87-93.
79. Wan, H., 1984b. (0, 1)-matrices class with prescribed row and column sums associated with integral partition lattices. Master's Thesis, Huazhong (Central China) University of Science and Technology, Wuhan.
80. Wan, H., 1985. Cardinal function of the class A(R, S) of (0, 1)-matrices and its nonzero-point set in integra partition lattices. J. Math. Res. Expo. 5, 117-120.
81. Wan, H., 1986. Combinatorial and Computing Theory of Nonnegative Integral Matrices. Dalian University of Technology Press, Dalian.
82. Wan, H., 1987. On the structure and enumeration of (0, 1)-matrices in integral partition lattices. Acta Math. Sin. 30, 289-302.
83. Wan, H., 1997. On nearly self-conjugate partition of a finite set. Discret. Math. 175, 239-247.
84. Wan, H., Li, Q., 1986. On the number of tournaments with prescribed score vector. Discret. Math. 61, 213-219.
85. Wan, H., Liu, H. and Wootton, J.C., 1998. Compositional complexity functions of biological sequences in integral partition lattices. Adv. Appl. Math., submitted.
86. Wan, H., Wootton, J.C., 1998. Axiomatic foundations of complexity functions of biological sequences. Ann. Comb. 3, 77-99.
87. Wolynes, P.G., 1997. As simple as can be? Nat. Struct. Biol. 4, 871-874.
88. Wootton, J.C., 1994a. Non-globular domains in protein sequences: automated segmentation using complexity measures. Comput. Chem. 18, 269-285.
89. Wootton, J.C., 1994b. Sequences with 'unusual' amino acid compositions. Curr. Opin. Struct. Biol. 4, 413-421.
90. Wootton, J.C., 1997. Simple sequences of protein and DNA. In: Bishop, M.J., Rawlings, C.J. (Eds.), DNA and Protein Sequence Analysis. Oxford University Press, New York, pp. 169-183.
91. Wootton, J.C., Federhen, S., 1993. Statistics of local complexity in amino acid sequences and sequence databases. Comput. Chem. 17, 149-163.
92. Wootton, J.C., Federhen, S, 1996. Analysis of compositionally biased regions in sequence databases. In: Doolittle, R.F. (Ed.), Methods in Enzymology, vol. 266. Academic Press, New York, pp. 554-571.