Finding Maximal Quasiperiodicities in Strings
Gerth Stølting Brodal
September 1999 |
Abstract:
Apostolico and Ehrenfeucht defined the notion of a maximal
quasiperiodic substring and gave an algorithm that finds all maximal
quasiperiodic substrings in a string of length
![]() ![]() ![]() ![]() ![]() Available as PostScript, PDF, DVI. |