Alignment between two multiple alignments

Authors:
Bin Ma;Zhuozhi Wang;Kaizhong Zhang
Affiliations:
Dept. of Computer Science, University of Western Ontario, London, Ont., Canada;Dept. of Computer Science, University of Western Ontario, London, Ont., Canada;Dept. of Computer Science, University of Western Ontario, London, Ont., Canada
Venue:
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Year:
2003

Citing 4
Cited 3

ReAligner: a program for refining DNA sequence multi-alignments

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Progressive multiple alignment with constraints

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
The complexity of multiple sequence alignment with SP-score that is a metric

Theoretical Computer Science
Aligning Alignments

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching

Aligning alignments exactly

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Multiple RNA Structure Alignment

CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
TreeRefiner: A Tool for Refining a Multiple Alignment on a Phylogenetic Tree

CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alignment of two multiple alignments arises naturally when constructing approximate multiple sequence alignments progressively. In this paper, we consider the problem of alignment of two multiple alignments with SP-score and linear gap costs. When there is no gap opening cost, this problem can be solved using the well-known dynamic programming algorithm for two sequences by viewing each column in the multiple alignments as an element. However if there are gap opening costs (sometimes referred as affine gap costs) then the problem becomes non-trivial. Gotoh [4] suggested a procedure for this problem and stated that "the total arithmetic operations used is close to (quadratic) in typical cases". Kececioglu and Zhang [7] gave heuristic algorithms based on optimistic and pessimistic gap counts and conjectured that this problem is NP-complete. In this paper we prove that this problem is indeed NP-complete and therefore settle this open problem. We then propose another heuristic algorithm for this problem.