Computing the λ-covers of a string

This publication has 8 references indexed in Scilit:

• PPM with the extended alphabet
  Information Sciences, 2006
• The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications
  Fundamenta Informaticae, 2006
• 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 on-line string superprimitivity test
  Information Processing Letters, 1992
• Optimal superprimitivity testing for strings
  Information Processing Letters, 1991
• An optimal algorithm for computing the repetitions in a word
  Information Processing Letters, 1981