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]

Authors

Michael Arnold

This author has not been identified. Look up 'Michael Arnold' in Google

Enno Ohlebusch

This author has not been identified. Look up 'Enno Ohlebusch' in Google