Use of runs statistics for pattern recognition in genomic DNA sequences

Journal of Computational Biology

Volumn 11, Issue 1, 2004, Pages 107-124

  Cheung, Leo Wang Kit ^a  

^a UNIVERSITY OF HAWAII CANCER CENTER   (United States)

Author keywords

Analysis of DNA bendability signals; Bivariate runs statistic; Finite Markov chain imbedding; Hidden Markov models; Probabilistic profiles of runs

Indexed keywords

CURVED DNA; GENOMIC DNA;

ALGORITHM; ANALYTIC METHOD; ARTICLE; BIVARIATE RUNS STATISTIC; DATA ANALYSIS; DNA BENDABILITY SIGNAL ANALYSIS; DNA SEQUENCE; EXPECTATION MAXIMIZATION ALGORITHM; FINITE MARKOV CHAIN IMBEDDING; HIDDEN MARKOV MODEL; MAXIMUM LIKELIHOOD METHOD; PATTERN RECOGNITION; PRIORITY JOURNAL; PROBABILISTIC PROFILE OF RUNS; PROBABILITY; RUNS STATISTICS; STATISTICAL MODEL; STATISTICS;

ALGORITHMS; COMPUTER GRAPHICS; COMPUTER SIMULATION; GENOME; PATTERN RECOGNITION, AUTOMATED; PROTEIN CONFORMATION; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SEQUENCE ANALYSIS, PROTEIN; SOFTWARE;

EID: 1842555283     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652704773416911     Document Type: Article

References (33)

1. Alberts, B., Bray, D., Lewis, J., Raff, M., Roberts, K., and Watson, J.D. 1994. Molecular Biology of the Cell, Garland Publishing, New York.
2. Baldi, P., and Brunak, S. 1998. Bioinformatics: The Machine Learning Approach, MIT Press, Cambridge, MA.
3. Baldi, P., Brunak, S., Chauvin, Y., and Pedersen, A.G. 1999. Structural basis for triplet repeat disorders: A computational analysis. Bioinformatics 15, 918-929.
4. Baldi, P., Chauvin, Y., Brunak, S., Gorodkin, J., and Pedersen, A.G. 1998. Computational applications of DNA structural scales, Proc. 6th Int. Conf. on Intelligent Systems for Molecular Biology, 35-42.
5. Balding, D., Bishop, M., and Cannings, C., eds. 2001. Handbook of Statistical Genetics, John Wiley, New York.
6. Brukner, I., Sánchez, R., Suck, D., and Pongor, S. 1995. Sequence-dependent bending propensity of DNA as revealed by Dnase I: Parameters for trinucleotides. Eur. Mol. Biol. Org. J. 14(8), 1812-1818.
7. Burge, C., and Karlin, S. 1997. Prediction of complete gene structures in human genomic DNA. J. Mol. Biol. 268, 78-94.
8. Churchill, G.A. 1989. Stochastic models for heterogeneous DNA sequences. Bull. Math. Biol. 51(1), 79-94.
9. Churchill, G.A. 1992. Hidden Markov chains and the analysis of genome structure. Computers and Chemistry 16(2), 107-115.
10. Churchill, G.A. 1998. Hidden Markov models, in Encyclopedia of Biostatistics, 1908-1916, John Wiley, New York.
11. David, F.N. 1947. A power function for tests of randomness in a sequence of alternatives. Biometrika 34, 335-339.
12. Durbin, R., Eddy, S., Krogh, A., and Mitchison, G. 1998. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, Cambridge University Press, Cambridge, UK.
13. Fu, J.C. 1996. Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica Sinica 6(4), 957-974.
14. Fu, J.C., and Koutras, M.V. 1994. Distribution theory of runs: A Markov chain approach. J. Am. Statist. Assoc. 89(427), 1050-1058.
15. Godbole, A.P. 1990. Specific formulae for some success run distributions. Statistics and Probability Letters 10, 119-124.
16. Hirano, K. 1986. Some properties of the distributions of order k, in A.N. Philippou, G.E. Bergum, and F. Horadam, eds., Fibonacci Numbers and Their Applications, 43-53, Reidel, Dordrecht.
17. Hirano, K., and Aki, S. 1993. On the number of occurrences of success runs of length k in a two-state Markov chain. Statistica Sinica 3, 313-320.
18. Jamshidian, M., and Jennrich, R.I. 1997. Acceleration of EM algorithm by using quasi-Newton methods. J. Royal Statist. Soc., Series B 59, 569-587.
19. Karlin, S., and Brendel, V. 1992. Chance and statistical significance in protein and DNA sequence analysis. Science 257, 39-49.
20. Krogh, A., Mian, I.S., and Haussler, D. 1994. A hidden Markov model that finds genes in E. coli DNA. Nucl. Acids Res. 22, 4768-4778.
21. Leroux, B.G., and Puterman, M.L. 1992. Maximum-penalized-likelihood estimation for independent and Markov-dependent mixture models. Biometrics 48, 545-558.
22. Leung, M.Y., Marsh, G.M., and Speed, T.P. 1996. Over- and under-representation of short DNA words in herpes virus genomes. J. Comp. Biol. 3, 345-360.
23. Liu, C., and Rubin, D.B. 1994. The ECME algorithm: A simple extension of EM and ECM with fast monotone convergence. Biometrika 81, 633-648.
24. Liu, C., Rubin, D.B., and Wu, Y.N. 1998. Parameter expansion to accelerate EM - The PX-EM algorithm. Biometrika 85, 755-770.
25. Lou, W.Y.W. 1996. On runs and longest run tests: A method of finite Markov chain imbedding. J. Am. Statist. Assoc. 91(436), 1595-1601.
26. McLachlan, G.J., and Krishnan, T. 1997. The EM Algorithm and Extensions, John Wiley, New York.
27. Meng, X.-L., and van Dyk, D. 1997. The EM algorithm - An old folk-song to a new fast tune (with discussion). J. Royal Statist. Soc., Series B 59, 551-567.
28. Mood, A.M. 1940. The distribution theory of runs. Ann. Math. Statist. 11, 367-392.
29. Pedersen, A.G., Baldi, P., Brunak, S., and Chauvin, Y. 1996. Characterization of prokaryotic and eukaryotic promoters using hidden Markov models, 182-191. Proc. 4th Int. Conf. on Intelligent Systems for Molecular Biology.
30. Pedersen, A.G., Baldi, P., Chauvin, Y., and Brunak, S. 1998. DNA structure in human RNA polymerase II promoters. J. Mol. Biol. 281(4), 663-673.
31. Pedersen, A.G., Baldi, P., Chauvin, Y., and Brunak, S. 1999. The biology of eukaryotic promoter prediction - A review. Computers and Chemistry 23(3-4), 191-207.
32. Schuster, E.F., and Gu, X. 1997. On the conditional and unconditional distributions of the number of runs in a sample from a multisymbol alphabet. Communications in Statistics-Simulation and Computation 26(2), 423-442.
33. Waterman, M.S. 1995. Introduction to Computational Biology: Maps, Sequences and Genomes, Chapman and Hall, London, UK.