English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The minimum common string partition problem is an NP-hard combinatorialoptimization problem with applications in computational biology. In this workwe propose the first integer linear programming model for solving this problem.Moreover, on the basis of the integer linear programming model we develop adeterministic 2-phase heuristic which is applicable to larger probleminstances. The results show that provenly optimal solutions can be obtained forproblem instances of small and medium size from the literature by solving theproposed integer linear programming model with CPLEX. Furthermore, newbest-known solutions are obtained for all considered problem instances from theliterature. Concerning the heuristic, we were able to show that it outperformsheuristic competitors from the related literature.

Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem