Estimating the probability of approximate matches

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

Volumn 1264, Issue , 1997, Pages 52-64

  Kurtz, Stefan ^a   Myers, Gene ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84948949404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_49     Document Type: Conference Paper

References (13)

1. L. Allison and C.S. Wallace. The Posterior Probability Distribution of Alignments and Its Application to Parameter Estimation of Evolutionary Trees and to Optimization of Multiple Alignments. Journal of Molecular Evolution, 39:418-430, 1994.
2. W.I. Chang and J. Lampe. Theoretical and Empirical Comparisons of Approximate String Matching Algorithms. In Proc. CPM92, LNCS 644, pages 175-184, 1992.
3. M.O. Dayhoff, R.M. Schwartz, and B.C. Orcutt. A Model of Evolutionary Change in Proteins. Matrices for Detecting Distant Relationships. Atlas of Protein Sequence and Structure, 5:345-358, 1978.
4. W.M. Fitch. Random Sequences. Journal of Molecular Biology, 163:171-176, 1983.
5. S. Kannan, Z. Sweedyk, and S. Mahaney. Counting and Random Generation of Strings in Regular Languages. In Proceedings of the Sixth Annual A CM-SIAM Symposium on Discrete Algorithms, pages 551-557, 1995.
6. S. Karlin and S.F. Altschul. Methods for Assessing the Statistical Significance of Molecular Sequence Features by using General Scoring Schemes. Proc. Nat. Acad. Sci. U.S.A., 87:2264-2268, 1990.
7. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast Pattern Matching in Strings. SIAM Journal on Computing, 6(2):323-350, 1977.
8. G. Mehldau and E.W. Myers. A System for Pattern Matching Applications on Biosequences. CABIOS, 9(3):299-314, 1993.
9. E.W. Myers. An O(ND) Differences Algorithm. Algorithmica, 2(1):251-266, 1986.
10. E.W. Myers. A Sublinear Algorithm for Approximate Keyword Searching. Algorithmica, 12(4/5):345-374, 1994.
11. E.W. Myers. Approximate Matching of Network Expressions with Spacers. Journal of Computational Biology, 3(1):33-51, 1996.
12. E. Ukkonen. Algorithms for Approximate String Matching. Information and Control, 64:100-118, 1985.
13. R.A. Wagner and M.J. Fischer. The String to String Correction Problem. Journal of the ACM, 21(1):168-173, 1974.