3 papers
cs.DS2026
Faster Exact Algorithms for Equal-Subset-Sum
Ryosuke Yamano, Tetsuo Shibuya
We study exact algorithms for Equal-Subset-Sum in the worst-case setting: given a set of integers, find two distinct subsets whose sums are equal. We estab…
cs.DS2026
Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements
Ryosuke Yamano, Tetsuo Shibuya
The Shortest Common Superstring (SCS) problem is a fundamental task in sequence analysis. In genome assembly, however, the double-stranded nature of DNA implies that each fragment…
cs.DS2026
Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements
Ryosuke Yamano, Tetsuo Shibuya
The Shortest Common Superstring (SCS) problem asks for the shortest string that contains each of a given set of strings as a substring. Its reverse-complement variant, the Shortest…