3 citations · 5 across the 4 of their papers we have counts for
1 paper · 1 filter
Jarno Alanko, Tuukka Norri
Given a set of strings, the shortest common superstring problem is to find the shortest possible string that contains all the input strings. The problem is NP-hard, but a lot of wo…