A superstring contains the target word as a substring.
超串把目标单词作为子串包含在其中。
Finding the shortest superstring that covers all given fragments is a classic optimization problem with practical applications in DNA assembly.
寻找能覆盖所有给定片段的最短超串,是一个经典的优化问题,并在 DNA 组装等场景中有实际应用。