Pairwise alignment with scoring on tuples
- 1 January 1995
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 215-229
- https://doi.org/10.1007/3-540-60044-2_45
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
This publication has 5 references indexed in Scilit:
- Analysis of Amino Acid Substitution during Divergent Evolution: The 400 by 400 Dipeptide Substitution MatrixBiochemical and Biophysical Research Communications, 1994
- A context dependent method for comparing sequencesLecture Notes in Computer Science, 1994
- Algorithms for the search of amino acid patterns in nucleic acid sequencesNucleic Acids Research, 1986
- An improved algorithm for matching biological sequencesJournal of Molecular Biology, 1982
- Identification of common molecular subsequencesJournal of Molecular Biology, 1981