Screening for unusual matched segments in multiple protein sequences

Communications in Statistics Part B: Simulation and Computation

Volumn 25, Issue 4, 1996, Pages 937-952

  Naus, Joseph I ^a   Sheng, Ke Ning ^b  

^a RUTGERS UNIVERSITY   (United States)

^b Roberts Pharmaceutical Corporation   (United States)

Author keywords

Alignment; Mismatching; Scan statistics

Indexed keywords

EID: 0009166080     PISSN: 03610918     EISSN: None     Source Type: Journal    
DOI: 10.1080/03610919608813351     Document Type: Article

References (16)

1. Arratia, R., Gordon, L. and Waterman, M. S. (1986), An Extreme Value Theory for Sequence Matching. Ann. Statist. 14, 971-993.
2. Arratia, R., Gordon, L. and Waterman, M. S. (1990), The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence Matching. Ann. Statist. 18, 539-570.
3. Fu, Y. X. and Curnow, R. N. (1990), Locating a Changed Segment in a Sequence of Bernoulli Variables. Biometrika, 77, 295-304.
4. Glaz, J. and Naus, J. I. (1991), Tight Bounds and Approximations for Scan Statistic Probabilities for Discrete Data. Ann. Appl. Probab. 1, 306-318.
5. Karlin, S. and Ghandour, G. (1985), Multiple-alphabet Amino Acid Sequence Comparisons of the Immunoglobulin k-chain Constant Domain. Proc. Natl. Acad. Sci. USA 82, 8597-8601.
6. Karlin, S. and Ost, F. (1987), Counts of Long Aligned Word Matches among Random Letter Sequences. Adv. Appl. Prob. 19, 293-351.
7. Karlin, S. and Ost, F. (1988), Maximal Length of Common Words among Random Letter Sequences. Ann. Probab. 16, 535-563.
8. Karlin, S. and Altschul (1993), Applications and Statistics for Multiple High-Scoring Segments in Molecular Sequences. Proc. Natl. Acad. Sci. U S A 90, 5873-5877.
9. Karwe, Vatsala V. and Naus, J. I. (1994), New Recursive Methods for Scan Statistic Probabilities. Technical Report #94-013, Rutgers Univ., New Brunswick, N.J.
10. Katiyar, S. K., Visvesvara, G. S. and Edlind, T. D. (1995), Comparisons of Ribosomal RNA Sequences from Amitochondrial Protozo: Implications for Processing, mRNA Binding and Paromomycin Susceptibility. Gene 152, 27-33.
11. Mott, R. F., Kirkwood, T. B. L., and Curnow, R. N. (1990), An Accurate Approximation to the Distribution of the Length of the Longest Matching Word between Two Random DNA Sequences. Bull. Math. Biol. 52, 773- 784.
12. Naus, J. I. (1982), Approximations for Distributions of Scan Statistics. J. Amer. Statist. Assoc. 77, 177-183.
13. Roytberg, M. A. (1992), A Search for Common Patterns in Many Sequences. Computer Applications in Biosciences, 8, 57-64.
14. Saperstein, B. (1976), The Analysis of Attribute Moving Averages: MIL-STD- 105D Reduced Inspection Plans. Paper presented at Sixth Conf. Stochastic Processes and Applications, Tel Aviv.
15. Sheng, K. (1993), Pattern Matching between Two Non-Aligned Random Sequences. Ph.D. Dissertation, Dept. of Statist., Rutgers Univ. New Brunswick, N.J.
16. Sheng, K. and Naus, J. (1994), Pattern Matching between Two Non-Aligned Random Sequences. Bull. Math. Biol. 56, 1143-1162.