MSA can thus find the best way to align the sequences with insertions or deletions in accordance with the scorer.
computing an optimal MSA is NP-complete (Wang and Jiang, 1994), thus we implement an approximate algorithm (Needleman and Wunsch, 1970) that iteratively aligns two sequences each time and treats the resulting alignment as a new sequence 2 .