Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1992: STACS 92 pp 425–436Cite as

On locally optimal alignments in genetic sequences

  • Conference paper
  • First Online:

  • 132 Accesses

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

Abstract

A substring \(\tilde x\) of a text string x has c-locally minimal distance from a pattern string y, c ε N ∪ {0}, if no other substring x′ of x with smaller edit distance to y exists which overlaps \(\tilde x\) by more than c characters. We show how to compute all substrings of x which have c- locally minimal distance from y and all corresponding alignments in O(m · n) time where n is the length of x and m is the length of y.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. [1974]. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass.

    Google Scholar 

  2. Blum, N. [1991]. On locally optimal alignments in genetic sequences, Research Report 8567-CS, Dept. of Computer Science, University of Bonn.

    Google Scholar 

  3. Masek, W. J., and Paterson, M. S. [1980]. A faster algorithm for computing string-edit distances. Journal of Computer and System Sciences 20, 18–31.

    Google Scholar 

  4. Myers, E. W. [1986]. An O(ND) difference algorithm and its variations. Algorithmica 1, 251–266.

    Google Scholar 

  5. Needleman, S. B., and Wunsch, C. D. [1970]. A general method applicable to the search for similarities in the amino-acid sequence of two proteins. Journal of Molecular Biology 48, 443–453.

    Google Scholar 

  6. Sankoff, D., and Kruskal, J. B. (eds.) [1983]. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, Mass.

    Google Scholar 

  7. Sellers, P. H. [1980]. The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms 1, 359–373.

    Google Scholar 

  8. Ukkonen, E. [1985]. Algorithms for approximate string matching. Information and Control 64, 100–118.

    Google Scholar 

  9. Waterman, M. S. [1984]. General methods of sequence comparison. Bulletin of Mathematical Biology 46, 473–500.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik IV, Universität Bonn, Römerstr. 164, W-5300, Bonn, F. R. Germany

    Norbert Blum

Authors
  1. Norbert Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Finkel Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blum, N. (1992). On locally optimal alignments in genetic sequences. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_202

Download citation

  • DOI: https://doi.org/10.1007/3-540-55210-3_202

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55210-9

  • Online ISBN: 978-3-540-46775-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation