An Efficient Algorithm for Identifying the Most Contributory Substring


Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and presents a solution for the Most Contributory Substring Problem, which identifies the single substring that represents the largest proportion of the characters within a set of strings. We show… (More)
DOI: 10.1007/978-3-540-74553-2_25
View Slides