-
Notifications
You must be signed in to change notification settings - Fork 14
Compressed Suffix Array Example
simongog edited this page Mar 28, 2012
·
2 revisions
A csa is not only a compressed version of the classic suffix array. It provides more functionality then only access to the suffix array values. Here is a brief operation overview:
-
operator[]provides access to the i-th element of the suffix array -
operator()provides access to the i-th element of the inverse suffix array -
bwt[]provides access to the i-th character of the Burrows-Wheeler Transform of the text -
psi[]provides access to the i-th element of the psi-function -
psi()provides access to the i-th element of the LF-function (the inverse of the psi-function) rank_bwtselect_bwt- the const member
.sigmareturns the size of the effective alphabet of the original text (including the added special terminal symbol)