An approximation algorithm for the shortest common supersequence problem: an experimental analysis

Paolo Barone, Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri. An approximation algorithm for the shortest common supersequence problem: an experimental analysis. In Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), March 11-14, 2001, Las Vegas, NV, USA. pages 56-60, ACM, 2001. [doi]

Abstract

Abstract is missing.