Skip to main content
SpringerLink
Log in

Estimating the probability of approximate matches

  • Conference paper
  • First Online:
Book cover Combinatorial Pattern Matching (CPM 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1264))

Included in the following conference series:

Research done while visiting the University of Arizona, partially supported by NLM grant LM-4960.

Partially supported by NLM grant LM-4960.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  4. W.M. Fitch. Random Sequences. Journal of Molecular Biology, 163:171–176, 1983.

    Google Scholar 

  5. S. Kannan, Z. Sweedyk, and S. Mahaney. Counting and Random Generation of Strings in Regular Languages. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 551–557, 1995.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  8. G. Mehldau and E.W. Myers. A System for Pattern Matching Applications on Biosequences. CABIOS, 9(3):299–314, 1993.

    Google Scholar 

  9. E.W. Myers. An O(ND) Differences Algorithm. Algorithmica, 2(1):251–266, 1986.

    Google Scholar 

  10. E.W. Myers. A Sublinear Algorithm for Approximate Keyword Searching. Algorithmica, 12(4/5):345–374, 1994.

    Google Scholar 

  11. E.W. Myers. Approximate Matching of Network Expressions with Spacers. Journal of Computational Biology, 3(1):33–51, 1996.

    Google Scholar 

  12. E. Ukkonen. Algorithms for Approximate String Matching. Information and Control, 64:100–118, 1985.

    Google Scholar 

  13. R.A. Wagner and M.J. Fischer. The String to String Correction Problem. Journal of the ACM, 21(1):168–173, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Fakultät, Universität Bielefeld, Postfach 100 131, D-33501, Bielefeld, Germany

    Stefan Kurtz

  2. Department of Computer Science, The University of Arizona, 85721, Tucson, Arizona, USA

    Gene Myers

Authors
  1. Stefan Kurtz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gene Myers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alberto Apostolico Jotun Hein

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurtz, S., Myers, G. (1997). Estimating the probability of approximate matches. In: Apostolico, A., Hein, J. (eds) Combinatorial Pattern Matching. CPM 1997. Lecture Notes in Computer Science, vol 1264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63220-4_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-63220-4_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63220-7

  • Online ISBN: 978-3-540-69214-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation