Advertisement

Pairwise alignment with scoring on tuples

  • Lukas Knecht
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 937)

Abstract

Pairwise alignment of two sequences a, b usually assumes a and b being sequences over the same alphabet A and a scoring function s: A×A→ℝ operating on symbol pairs. The framework presented here extends this to a scoring function s: A p ×B q →ℝ operating on p-tuples and q-tuples of symbols, where the scoring tuples can have an arbitrary (but not complete) overlap.

We show that, if the alphabets A and B are finite and p and q are constant, the resulting algorithms have the same asymptotic time and space complexity as their single symbol counterparts.

This framework has been applied successfully to the codon-wise alignment of prokaryotic and eukaryotic genes.

Keywords

Space Complexity Dynamic Programming Algorithm Pairwise Alignment Good Alignment Global Alignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mark A. Cohen, Steven A. Benner, and Gaston H. Gonnet. Analysis of mutation during divergent evolution: The 400 by 400 dipeptide mutation matrix. Biochem. Biophys. Res. Commun., 199:489–496, 1994.PubMedGoogle Scholar
  2. 2.
    Gaston H. Gonnet. A tutorial introduction to computational biochemistry using Darwin. E.T.H. Zurich, Switzerland, 1994.Google Scholar
  3. 3.
    O. Gotoh. An improved algorithm for matching biological sequences. Journal of Molecular Biology, 162:705–708, 1982.PubMedGoogle Scholar
  4. 4.
    Xiaoqiu Huang. A context dependent method for comparing sequences. In M. Crochemore and D. Gusfield, editors, Combinatorial Pattern Matching, volume 807 of Lecture Notes in Computer Science, pages 54–63. Springer-Verlag, 1994.Google Scholar
  5. 5.
    E. W. Myers and M. Miller. Optimal alignments in linear space. Comput. Applic. Biosci., 4:11–17, 1988.Google Scholar
  6. 6.
    Hannu Peltola, Hans Söderlund, and Esko Ukkonen. Algorithms for the search of amino acid patterns in nucleic acid sequences. Nucleic Acids Research, 14:99–107, 1986.PubMedGoogle Scholar
  7. 7.
    T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195–197, 1981.PubMedGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Lukas Knecht
    • 1
  1. 1.Institute for Scientific ComputingETH ZurichZurichSwitzerland

Personalised recommendations