Suboptimal Local Alignments Across Multiple Scoring Schemes

Abstract. Sequence alignment algorithms have a long standing tradition in bioinformatics. In this paper, we formulate an extension to existing local alignment algorithms: local alignments across multiple scoring functions. For this purpose, we use the Waterman-Eggert algorithm for suboptimal local alignments as template and introduce two new features therein: 1) an alignment of two strings over a set of score functions and 2) a switch cost function δ for penalizing jumps into a different scoring scheme within an alignment. Phylogenetic footprinting, as one potential application of this algorithm, was studied in greater detail. In this context, the right evolutionary distance and thus the scoring scheme is often not known a priori. We measured sensitivity and specificity on a test set of 21 human-rodent promoter pairs. Ultimately, we could attain a 4.5-fold enrichment of verified binding sites in our alignments. Key words: Sequence alignment, non-parametric alignment, phylogenetic f...

• Type: Conference
• Year: 2004
• Where: WABI
• Authors: Morris Michael, Christoph Dieterich, Jens Stoye
• Keywords: Algorithms, Alignment Algorithms, Local Alignments, Sequence Alignment, WABI 2004