Bongartz, D. (2012). On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem. Computing and Informatics, 20(4), 325–357. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/527