Enter your text below to generate useful data structures!
Choose your data structures and factorizations (drag and drop or double-click):
You can use drag and drop to reorder your selection!
Inverse Suffix Array
inverse of the bijective Burrows-Wheeler transform
its i-th entry is the index (starting with zero for the leftmost) of the Lyndon factor corresponding to BBWT[i]
its i-th entry is the text position at which the conjugate of the Lyndon factor starts whose last position is BBWT[i]
the inverse permutation of CSA
QuickArrays built the following data structures and factorizations for you:
character runs (
The state of QuickArrays is stored in the URL.
By creating a bookmark, you can return to the current state at any time.