The Carrillo-Lipman Bound establishes an upper bound on the score of the optimal multiple alignment, by considering the implications of the score of some heuristic multiple alignment. Thereby, whole regions of the dynamic programming hyperlattice need not be explored.
Carrillo-Lipman