The constrained multiple sequence alignment (CMSA) problem is to align a set of strings such that the given patterns (the constraint) appear in the same positions in a specified order in each of the strings in the resulting alignment. The best previous result for the pair-wise version takes O(mn) time and space [2, 10], where m is the number of patterns (defined later) and n is the maximum stri...