## Fast lightweight suffix array construction and checking (2003)

by
Stefan Burkhardt
,
Juha Kärkkäinen

Venue: | 14th Annual Symposium on Combinatorial Pattern Matching |

Citations: | 25 - 5 self |

### BibTeX

@INPROCEEDINGS{Burkhardt03fastlightweight,

author = {Stefan Burkhardt and Juha Kärkkäinen},

title = { Fast lightweight suffix array construction and checking},

booktitle = {14th Annual Symposium on Combinatorial Pattern Matching},

year = {2003},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

We describe an algorithm that, for any v 2 [2; n], constructs the suffix array of a string of length n in O(vn + n log n) time using O(v + n= p v) space in addition to the input (the string) and the output (the suffix array). By setting v = log n, we obtain an O(n log n) time algorithm using O n= p