Sequence complexity for biological sequence analysis

Computers and Chemistry

Volumn 24, Issue 1, 2000, Pages 43-55

  Allison, L ^a   Stern, L ^b   Edgoose, T ^a   Dix, T I ^a  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Algorithm; Complexity; DNA; Entropy; Pattern discovery; Sequence analysis

Indexed keywords

DROSOPHILA PROTEIN; INSECT PROTEIN; MASTERMIND PROTEIN, DROSOPHILA; NUCLEAR PROTEIN;

ALGORITHM; ARTICLE; CHEMISTRY; COMPUTER SIMULATION; DNA SEQUENCE; INFORMATION SCIENCE; NUCLEOTIDE REPEAT; PROBABILITY;

ALGORITHMS; COMPUTER SIMULATION; DROSOPHILA PROTEINS; INFORMATION THEORY; INSECT PROTEINS; MARKOV CHAINS; NUCLEAR PROTEINS; REPETITIVE SEQUENCES, NUCLEIC ACID; SEQUENCE ANALYSIS, DNA;

EID: 0033630766     PISSN: 00978485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8485(00)80006-6     Document Type: Article

References (38)

1. Agarwal, P., States, D.J., 1994. The repeat pattern toolkit (RPT): analyzing the structure and evolution of the C. elegans genome, Proceedings of the Second Conference on Intelligent Systems, Mol. Biol., pp. 1-9.
2. Allison, L., Edgoose, T., Dix, T.I., 1998. Compression of strings with approximate repeats, Intelligent Systems in Molecular Biology, ISMB '98, Montreal, pp. 8-16.
3. Allison, L., Wallace, C.S., Yee, C.N., 1992. Finite-state models in the alignment of macro-molecules. J. Mol. Evol. 35 (1), 77-89.
4. Allison, L., Yee, C.N., 1990. Minimum message length encoding and the comparison of macromolecules. Bull. Math. Biol. 52 (3), 431-453.
5. Barabelle, F.E., Shoulders, C.C., Goodbourn, S., Jeffreys, A., Proudfoot, N.J., 1980. The 5′ flanking region of human epsilon-globin gene. Nucleic Acids Res. 8, 4393-4404.
6. Baum, L.E., Eagon, J.E., 1967. An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model of ecology. Bull. AMS 73, 360-363.
7. Baum, L.E., Petrie, T., Soules, G., Weiss, N., 1970. A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat. 41, 164-171.
8. Bayes, T., 1763. An essay towards solving a problem in the doctrine of chances. Phil. Trans. Royal Soc. Lond., 53, 370-418; reprinted in Biometrika 45, 296-315 (1958).
9. Bayes, T., 1763. An essay towards solving a problem in the doctrine of chances. Phil. Trans. Royal Soc. Lond., 53, 370-418; reprinted in Biometrika 45, 296-315 (1958).
10. Boulton, D.M., Wallace, C.S., 1969. The information content of a multistate distribution. J. Theor. Biol. 23, 269-278.
11. Chaitin, G.J., 1966. On the length of programs for computing finite binary sequences. J. Assoc. Comp. Mach. 13 (4), 547-569.
12. Cleary, J., Teahan, W.J., 1997. Unbounded length contexts for PPM. Comp. J. 40 (2/3), 67-75.
13. Collins, F.S., Weissman, S.M., 1984. The molecular genetics of hemoglobin. Prog. Nucleic Acids Res. Mol. Biol. 31, 315-462.
14. Dempster, A.P., Laird, N.M., Rubin, D.B., 1977. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc. B 39, 1-38.
15. Eddy, S.R., 1998. Profile hidden Markov models (review). Bioinformatics 14 (9), 755-763.
16. Gotoh, O., 1982. An improved algorithm for matching biological sequences. J. Mol. Biol. 162, 705-708.
17. Grumbach, S., Tahi, F., 1994. A new challenge for compression algorithms: genetic sequences. Inf. Proc. Manag. 30 (6), 875-886.
18. Kolmogorov, A.N., 1965. Three approaches to the quantitative definition of information. Probl. Inf. Transm. 1 (1), 1-7.
19. Langdon, G.G., 1984. An introduction to arithmetic coding. IBM J. Res. Dev. 28 (2), 135-149.
20. Lempel, A., Ziv, J., 1976. On the complexity of finite sequences. IEEE Trans. Inf. Theory IT-22, 783-795.
21. Li, Q., Powers, P.A., Smithies, O., 1985. Nucleotide sequence of 16-kilobase pairs of DNA 5′ to the human epsilon-globin gene. J. Biol. Chem. 260, 14901-14910.
22. Loewenstern, D.M., Yianilos, P.N., 1997. Significantly lower entropy estimates for natural DNA sequences. IEEE Data Compress. Conf. DCC97 C97, 151-160.
23. Miller, W., Myers, E.W., 1988. Sequence comparison with concave weighting functions. Bull. Math. Biol. 50 (2), 97-120.
24. Milosavljevic, A., Jurka, J., 1993. Discovering simple DNA sequences by the algorithmic significance method. Comp. Appl. BioSci. 9 (4), 407-411.
25. Poncz, M., Schwartz, E., Ballantine, M., Surrey, S., 1983. Nucleotide sequence analysis of the delta-beta globin gene region in humans. J. Biol. Chem. 258, 11599-11609.
26. Powell, D.R., Allison, L., Dix, T.I, Dowe, D.L., 1998a. Alignment of low information sequences, Australian Computer Science Theory Symposium, CATS '98, Perth, Springer Verlag, ISBN 981-3083-92-1, pp. 215-230.
27. Powell, D.R., Dowe, D.L., Allison, L., Dix, T.I. 1998b. Discovering simple DNA sequences by compression, Pacific Symposium on Biocomputing, Hawaii, pp. 597-608.
28. Rissanen, J. 1987. Stochastic complexity. J. Royal Stat. Soc. B 49(3) 223-239 and 252-265.
29. Rivals, E., Dauchet, M. 1997. Fast discerning repeats in DNA sequences with a compression algorithm, Proceedings of the Genome Informatics Workshop, Tokyo, pp. 215-226.
30. Rogan, P.K., Pan, J., Weissman, S.M., 1987. L1 repeat elements in the human epsilon-G-gamma-globin gene intergenic region: sequence analysis and concerted evolution within this family. Mol. Biol. Evol. 4, 327-342.
31. Shannon, C.E., 1949. The Mathematical Theory of Communication. U. Illinois Press, USA.
32. Slightom, J.L., Blechl, A.E., Smithies, O., 1980. Human fetal G-gamma- and A-gamma globin genes. Cell 21, 627-638.
33. Solomonoff, R., 1964. A formal theory of inductive inference, I and II. Inf. Control 7, 1-22; 224-254.
34. Tichy, W.F., 1984. The string-to-string correction problem with block moves. ACM Trans. Comp. Sys. 2 (4), 309-321.
35. Wallace, C.S., Boulton, D.M., 1968. An information measure for classification. Comp. J. 11 (2), 185-194.
36. Wallace, C.S., Freeman, P.R., 1987. Estimation and inference by compact coding. J. Royal Stat. Soc. Series B. 49 (3), 240-265.
37. Wootton, J.C., 1997. Simple sequences of protein and DNA, In: Bishop, M.J., Rawlings, C.J. (Eds.), DNA and Protein Sequence Analysis, A Practical Approach, IRL Press, pp. 169-183.
38. Ziv, J., Lempel, A., 1977. A universal algorithm for sequential data-compression. IEEE Trans. Inf. Theory IT-23, 337-343.