Container problem in substring reversal graphs

Abstract

In this paper, we propose an algorithm that solves the container problem in n-substring reversal graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of path lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm.