The Prague Stringology Conference 2003
Costas S. Iliopoulos, Laurent Mouchard, Katerina G. Perdikuri and Athanasios K. Tsakalidis
Computing the Repetitions in a Weighted Sequence
| Abstract: |
| We present an O(n log n) algorithm for computing the set of repetitions in a weighted sequence with probability of appearance larger than 1/k, where k is a given constant. |
| Download paper: |  |
 |
| PostScript |