Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 644 LNCS, Issue , 1992, Pages 27-40

  Atallah, Mikhail J ^a   Jacquet, Philippe ^b   Szpankowski, Wojciech ^a  

^a PURDUE UNIVERSITY   (United States)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALL POSITIONS; BERNOULLI; HIGH PROBABILITY; INPUT STRING; PROBABILISTIC ANALYSIS; PROBABILISTIC CHARACTERISTICS; RANDOMIZED ALGORITHMS; TIME COMPLEXITY;

PATTERN MATCHING;

EID: 84990691904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56024-6_3     Document Type: Conference Paper

References (27)

1. K. Abrahamson, Generalized String Matching, SIAM J. Comput., 16, 1039–1051, 1987.
2. Abramowitz, M. and Stegun, I., Handbook of Mathematical Functions, Dover, New York (1964).
3. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
4. Aldous, D., Probability Approximations via the Poisson Clumping Heuristic, Springer Verlag, New York 1989.
5. Arratia, R., Gordon, L., and Waterman, M., An Extreme Value Theory for Sequence Matching, Annals of Statistics, 14, 971–993, 1986.
6. Arratia, R., Gordon, L., and Waterman, M., The Erdös-Rényi Law in Distribution, for Coin Tossing and Sequence Matching, Annals of Statistics, 18, 539–570, 1990.
7. Chang, W.I. and Lawler, E.L., Approximate String Matching in Sublinear Expected Time, Proc. 31st Ann. IEEE Symp. on Foundations of Comp. Sci., 116–124, 1990.
8. Chung, K.L. and Erdös, P., On the Application of the Borel-Cantelli Lemma, Trans. of the American Math. Soc., 72, 179–186, 1952.
9. DeLisi, C., The Human Genome Project, American Scientist, 76, 488–493, 1988.
10. Feller, W., An Introduction to Probability Theory and its Applications, Vol. 2, John Wiley & Sons, New York (1971).
11. Flajolet, P., Analysis of Algorithms, in Trends in Theoretical Computer Science (ed. E. Börger), Computer Science Press, 1988.
12. Galambos, J., The Asymptotic Theory of Extreme Order Statistics, John Wiley & Sons, New York (1978).
13. Galil, Z. and Park, K., An Improved Algorithm for Approximate String Matching, SIAM J. Comp., 19, 989–999, 1990.
14. L. Guibas and A. Odlyzko, Periods in Strings Journal of Combinatorial Theory, Series A, 30, 19–43 (1981).
15. L. Guibas and A. W. Odlyzko, String Overlaps, Pattern Matching, and Nontransitive Games, Journal of Combinatorial Theory, Series A, 30, 183–208 (1981).
16. Henrici, P., Applied and Computational Complex Analysis, vol. I., John Wiley & Sons, New York 1974.
17. Jacquet, P. and Szpankowski, W., Autocorrelation on Words and Its Applications. Analysis of Suffix Trees by String-Ruler Approach, INRIA Technical report No. 1106, October 1989; submitted to a journal.
18. Karlin, S. and Ost, F., Counts of Long Aligned Matches Among Random Letter Sequences, Adv. Appl. Probab., 19, 293–351, 1987.
19. Knuth, D.E., J. Morris and V. Pratt, Fast Pattern Matching in Strings, SIAM J. Computing, 6, 323–350, 1977.
20. Landau, G.M. and Vishkin, U., Efficient String Matching with k Mismatches, Theor. Comp. Sci., 43, 239–249, 1986.
21. Landau, G.M. and Vishkin, U., Fast String Matching with k Differences, J. Comp. Sys. Sci., 37, 63–78, 1988.
22. Landau, G.M. and Vishkin, U., Fast Parallel and Serial Approximate String Matching, J. Algorithms, 10, 157–169, 1989.
23. E.W. Myers, An O(ND) Difference Algorithm and Its Variations, Algorithmica, 1, 252–266, 1986.
24. Noble, B. and Daniel, J., Applied Linear Algebra, Prentice-Hall, New Jersey 1988
25. Seneta, E., Non-Negative Matrices and Markov Chains, Springer-Verlag, New York 1981.
26. Szpankowski, W., On the Height of Digital Trees and Related Problems, Algorithmica, 6, 256–277, 1991.
27. M. Zuker, Computer Prediction of RNA Structure, Methods in Enzymology, 180, 262–288, 1989.