Approximate word matches between two random sequences

Annals of Applied Probability

Volumn 18, Issue 1, 2008, Pages 1-21

  Burden, Conrad J ^a,c   Kantorovitz, Miriam R ^b   Wilson, Susan R ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c Australian National University   (Australia)

Author keywords

DNA sequences; Sequence comparison; Word matches

Indexed keywords

EID: 53349103352     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/07-AAP452     Document Type: Article

References (18)

1. BARBOUR, A. and CHRYSSAPHINOU, O. (2001). Compound Poisson approximation: A user's guide. Ann. Appl. Probab. 11 964-1002. MR1865030
2. BURKE, J., DAVISON, D. and HIDE, W. (1999). d2 cluster: A validated method for clustering EST and full-length cDNA sequences. Genome Res. 9 1135-1142.
3. CARPENTER, J. E., CHRISTOFFELS, A., WEINBACH, Y. and HIDE, W. A. (2002). Assessment of the parallelization approach of d2 cluster for high-performance sequence clustering. J. Comput. Chem. 23 755-757.
4. CONOVER, W. J. (1999). Practical Nonparametric Statistics. Wiley, New York.
5. CHEN, L. H. Y. (1975). Poisson approximation for dependent trials. Ann. Probab. 3 534-545. MR0428387
6. CHRISTOFFELS, A., VAN GELDER, A., GREYLING, G., MILLER, R., HIDE, T. and HIDE, W. (2001). STACK: Sequence tag alignment and consensus knowledgebase. Nucleic Acids Res. 29 234-238.
7. DEMBO, A. and RINOTT, Y. (1996). Some examples of normal approximations by Stein's method. IMA Vol. Math. Appl. 76 25-44. MR1395606
8. JANSON, S. (1988). Normal convergence by higher semiinvariants with applications to sums of dependent random variables and random graphs. Ann. Probab. 16 305-312. MR0920273
9. KANTOROVITZ, M. R., BOOTH, H. S., BURDEN, C. J. and WILSON, S. R. (2007). Asymptotic behavior of k-word matches between two random sequences. J. Appl. Probab. 44 788-805.
10. LIPPERT, R. A., HUANG, H. and WATERMAN, M. S. (2002). Distributional regimes for the number of k-word matches between two random sequences. Proc. Natl. Acad. Sci. USA 99 13980-13989. MR1944413
11. MILLER, R. T., CHRISTOFFELS, A. G., GOPALAKRISHNAN, C., BURKE, J., PTITSYN, A. A., BROVEAK, T. R. and HIDE, W. A. (1999). A comprehensive approach to clustering of expressed human gene sequence: The sequence tag alignment and consensus knowledge base. Genome Res. 9 1143-1155.
12. MELKO, O.M. and MUSHEGIAN, A. R. (2004). Distribution of words with a predefined range of mismatches to a DNA probe in bacterial genomes. Bioinformatics 20 67-74.
13. SMITH, T. F. and WATERMAN, M. S. (1981). Identification of common molecular subsequences. J. Mol. Biol. 147 195-197.
14. STEIN, C. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability 2 583-602. Univ. California Press, Berkeley, CA. MR0402873
15. STEIN, C. (1986). Approximate Computation of Expectations. IMS, Hayward, CA. MR0882007
16. VINGA, S. and ALMEIDA, J. S. (2003). Alignment-free sequence comparison - a review. Bioinformatics 19 513-523.
17. WATERMAN, M. S. (2000). Introduction to Computational Biology. Chapman and Hall/CRC, New York.
18. ZHANG, Y. X., PERRY, K., VINCI, V. A., POWELL, K., STEMMER, W. P. and DEL CARDAYRE, S. B. (2002). Genome shuffling leads to rapid phenotypic improvement in bacteria. Nature 415 644-646.