Enhanced string covering

This publication has 11 references indexed in Scilit:

• Computing regularities in strings: A survey
  European Journal of Combinatorics, 2013
• New complexity results for the k-covers problem
  Information Sciences, 2011
• mreps: efficient and flexible detection of tandem repeats in DNA
  Nucleic Acids Research, 2003
• Computing the Cover Array in Linear Time
  Algorithmica, 2002
• A work-time optimal algorithm for computing all string covers
  Theoretical Computer Science, 1996
• A correction to “An optimal algorithm to compute all the covers of a string”
  Information Processing Letters, 1995
• An optimal algorithm to compute all the covers of a string
  Information Processing Letters, 1994
• Efficient detection of quasiperiodicities in strings
  Theoretical Computer Science, 1993
• An on-line string superprimitivity test
  Information Processing Letters, 1992
• Optimal superprimitivity testing for strings
  Information Processing Letters, 1991