Page 113

Chvátal, V, and D. Sankoff, 1975, "Longest common subsequences of two random sequences," Journal of Applied Probability 12, 306-315.

Deken, J., 1979, "Some limit results for longest common subsequences," Discrete Mathematics 26, 17-31.

Erdös, P., and A. Rényi, 1970, "On a new law of large numbers," Journal d' Analyse Mathematique 22, 103-111. Reprinted in 1976 in Selected Papers of Alfred Rényi, Vol. 3, 1962-1970, Budapest: Akadémiai Kiadó.

Feller, W., 1968, An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed., New York: Wiley and Sons.

Goldstein, L., 1990, "Poisson approximation and DNA sequence matching," Communications in Statistics. Part A: Theory and Methods 19, 4167-4179.

Kingman, J.F.C., 1973, "Subadditive ergodic theory," Annals of Probability 1, 883909.

Smith, T.F., and M.S. Waterman, 1981, "Identification of common molecular subsequences," Journal of Molecular Biology 147, 195-197.

Steele, J.M., 1986, "An Efron-Stein inequality for nonsymmetric statistics," Annals of Statistics 14, 753-758.

Waterman, M.S., and M. Eggert, 1987, "A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons," Journal of Molecular Biology 197, 723-728.

Waterman, M.S., L. Gordon, and R. Arratia, 1987, "Phase transitions in sequence matches and nucleic acid structure," Proceedings of the National Academy of Sciences USA 84, 1239-1243.

Waterman, M.S., and M. Vingron, 1994, "Rapid and accurate estimates of statistical significance for data base searches," Proceedings of the National Academy of Sciences USA 91, 4625-4628.



The National Academies | 500 Fifth St. N.W. | Washington, D.C. 20001
Copyright © National Academy of Sciences. All rights reserved.
Terms of Use and Privacy Statement