Fast and Practical Algorithms for Computing All the Runs in a String

This publication has 20 references indexed in Scilit:

• A New Periodicity Lemma
  SIAM Journal on Discrete Mathematics, 2006
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
  SIAM Journal on Computing, 2005
• Replacing suffix trees with enhanced suffix arrays
  Journal of Discrete Algorithms, 2004
• Space Efficient Linear Time Construction of Suffix Arrays
  2003
• Optimal suffix tree construction with large alphabets
  2002
• Reducing the space requirement of suffix trees
  Software: Practice and Experience, 1999
• New approaches for computer analysis of nucleic acid sequences.
  Proceedings of the National Academy of Sciences, 1983
• Optimal off-line detection of repetitions in a string
  Theoretical Computer Science, 1983
• An optimal algorithm for computing the repetitions in a word
  Information Processing Letters, 1981
• On the Complexity of Finite Sequences
  IEEE Transactions on Information Theory, 1976