The time complexity of aligning N sequences of length L is O(2 N L N ) (Wang and Jiang, 1994).
for MSA using dynamic programming, we use a heuristic method where we combine pairwise alignments iteratively starting with the latest narrative and progressing towards the oldest narrative.