Reoptimization of the Closest Substring Problem under Pattern Length Modification


Œis study investigates whether reoptimization can help in solving the closest substring problem. We are dealing with the following reoptimization scenario. Suppose, we have an optimal llength closest substring of a given set of sequences S. How can this information be bene€cial in obtaining an (l + k)-length closest substring for S? In this study, we show… (More)


2 Figures and Tables

Slides referencing similar topics