Shortest Common Superstring

Правка en1, от albeXL, 2017-11-29 21:47:38

Can someone help me solve this problem? Given N <= 16 strings I need to find the shortest(in length) string that contains all N strings as a substring, in case of a tie I need to find the smallest one in lexicographic order. Thanks in advance

Теги strings, superstring

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский albeXL 2017-11-29 21:47:38 273 Initial revision (published)