Challenges of Optimal Multiple Alignments
Space complexity (hyperlattice size): O(nk) for k sequences each n long.
Computing a hyperlattice node: O(2k).
Time complexity: O(2knk).
Find the optimal solution is exponential in k (non-polynomial, NP-hard).