Combinatorial optimization is a good strategy to solve MSA problem.
(3) Each pattern P_i (i=1,2, .. ,z) corresponds to a node v, and the path from the root K to the node v can exactly correctly spell the string P_i.