Javascript must be enabled for the correct page display

On suffix arrays

Marinissen, B. (2014) On suffix arrays. Bachelor's Thesis, Mathematics.

[img]
Preview
Text
main.pdf - Published Version

Download (1MB) | Preview
[img] Text
toestemming.pdf - Other
Restricted to Backend only

Download (19kB)

Abstract

We review the fundamental connections and differences between the suffix tree and the enhanced suffix array (ESA). The two structures are more deeply related than they appear. In fact, the ESA can fully replace the suffix tree. The curious effects of large alphabets are also reviewed. Ultimately, a cohesive explanation of the two structures and how they can be generalized is presented.

Item Type: Thesis (Bachelor's Thesis)
Degree programme: Mathematics
Thesis type: Bachelor's Thesis
Language: English
Date Deposited: 15 Feb 2018 07:58
Last Modified: 15 Feb 2018 07:58
URI: http://fse.studenttheses.ub.rug.nl/id/eprint/12117

Actions (login required)

View Item View Item