Linear Time Algorithms for Generalizations of the Longest Common Substring Problem

Michael Arnold, Enno Ohlebusch. Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. Algorithmica, 60(4):806-818, 2011. [doi]

Abstract

Abstract is missing.