Fast, Practical Algorithms for Computing All the Repeats in a String
Given a string x = x[1..n] on an alphabet of size α, and a threshold p min ≥ 1, we describe four variants of an algorithm PSY1 that, using a suffix array, computes all the complete nonextendible repeats in x of length p ≥ p min . The basic algorithm PSY1–1 and its simple extension PSY1–2 are fast on...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/36774 |