Global and local sequence alignment with a bounded number of gaps

• Published in: Theoretical computer science Vol. 582; pp. 1 - 16
• Main Authors: Barton, Carl, Flouri, Tomáš, Iliopoulos, Costas S., Pissis, Solon P.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 31-05-2015
• Subjects: Accuracy; Algorithms; Algorithms on strings; Alignment; Dynamic programming; Gene sequencing; Genomes; Mathematical models; Pairwise sequence alignment; Scoring; Sequences; Pairwise sequence alignment; Algorithms on strings; Dynamic programming
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2015.03.016

Pairwise sequence alignment techniques have gained renewed interest in recent years, primarily due to their applications in re-sequencing—the assembly of a genome directed by a reference sequence.
In this article, we show that adding the flexibility of bounding the number of gaps inserted in an alignment strengthens the classical sequence alignment scheme of scoring matrices and affine gap penalty scores. We present GapsMis, an algorithm for pairwise global sequence alignment with a variable, but bounded, number of gaps. It is based on computing a variant of the traditional dynamic programming matrix for global sequence alignment. We also present GapsMis-L, the analogous algorithm for pairwise local sequence alignment with a variable, but bounded, number of gaps.
To test the accuracy of GapsMis and GapsMis-L we performed millions of pairwise sequence alignments under realistic conditions, based on the properties of real full-length genomes. The results show that GapsMis and GapsMis-L can increase the accuracy of extending short-read alignments compared to the traditional approaches. The importance of our contribution is underlined by the fact that the provided algorithms may be seamlessly integrated into any biological pipeline. The open-source code of our implementation is freely available at http://www.inf.kcl.ac.uk/research/projects/gapmis/.