Project Alice
|
Go to the source code of this file.
Functions | |
int | divsufsort (const unsigned char *T, int *SA, int n, int openMP) |
int | divbwt (const unsigned char *T, unsigned char *U, int *A, int n, unsigned char *num_indexes, int *indexes, int openMP) |
int divbwt | ( | const unsigned char * | T, |
unsigned char * | U, | ||
int * | A, | ||
int | n, | ||
unsigned char * | num_indexes, | ||
int * | indexes, | ||
int | openMP | ||
) |
Constructs the burrows-wheeler transformed string of a given string.
T | [0..n-1] The input string. |
U | [0..n-1] The output string. (can be T) |
A | [0..n-1] The temporary array. (can be NULL) |
n | The length of the given string. |
num_indexes | The length of secondary indexes array. (can be NULL) |
indexes | The secondary indexes array. (can be NULL) |
openMP | enables OpenMP optimization. |
Definition at line 1876 of file divsufsort.c.
int divsufsort | ( | const unsigned char * | T, |
int * | SA, | ||
int | n, | ||
int | openMP | ||
) |
Constructs the suffix array of a given string.
T | [0..n-1] The input string. |
SA | [0..n-1] The output array of suffixes. |
n | The length of the given string. |
openMP | enables OpenMP optimization. |
Definition at line 1847 of file divsufsort.c.