Instances of the Shortest Common Supersequence Problem
收藏数据链接：
官方服务：
资源简介：
Shortest Common Supersequence Problem: https://en.wikipedia.org/wiki/Shortest_common_supersequence_problem<br>Each problem instance comprises <i>n</i> strings (each of them of a possibly different length) taken from an alphabet with <i>m</i> symbols. <br><br>The collection includes both randomly generated instances and instances obtained from biological sequences.<br>
提供机构：
figshare创建时间：
2019-05-20
