Steiner Consensus String Problem

We propose an algorithm to find the best path through an intersection of arbitrarily many weighted automata, without actually perform- ing the intersection. The algorithm is based on dual decomposition: …...