Fast optimal algorithms for computing all the repeats in a string
Given a string x = x[1..n] on an alphabet of size a, and a threshold pmin = 1, we first describe a new algorithm PSY1 that, based on suffix array construction, computes all the complete nonextendible repeats in x of length p = pmin. PSY1 executes in Θ(n) time independent of alphabet size and is an o...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
PSC
2008
|
| Online Access: | http://www.stringology.org/event/2008/p15.html http://hdl.handle.net/20.500.11937/35833 |