A space-efficient algorithm for sequence alignment with inversions and reversals

A dynamic programming algorithm to find an optimal alignment for a pair of DNA sequences has been described by Schöniger and Waterman. The alignments use not only substitutions, insertions, and deletions of single nucleotides, but also inversions, which are the reversed complements, of substrings of the sequences. With the restriction that the inversions are pairwise non-intersecting, their proposed algorithm runs in O ( n 2 m 2 ) time and consumes O ( n 2 m 2 ) space, where n and m are the lengths of the input sequences, respectively. We develop a space-efficient algorithm to compute such an optimal alignment which consumes only O ( nm ) space within the same amount of time. Our algorithm enables the computation for a pair of DNA sequences of length up to 10, 000 to be carried out on an ordinary desktop computer. Simulation study is conducted to verify some biological facts about gene shuffling across species.

Authors

• Zhi-Zhong Chen
• Yong Gao
• Guohui Lin
• Robert Niewiadomski Jose Nelson Amaral
• Yang Wang
• Junfeng Wu

Keywords

• Sequence alignment
• Inversion
• Reversal
• Dynamic programming