QuickArrays

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!
Enabled:
Input Text
Index Array
Suffix Array
Inverse Suffix Array
Disabled:
Φ Array
Φ-1 Array
LCP Array
PLCP Array
Ψ Array
Sorted Rotations
Front Row
BWT
Biject. BWT
Biject. BWT⁻¹ inverse of the bijective Burrows-Wheeler transform
Biject. IDs its i-th entry is the index (starting with zero for the leftmost) of the Lyndon factor corresponding to BBWT[i]
CSA its i-th entry is the text position at which the conjugate of the Lyndon factor starts whose last position is BBWT[i]
CISA the inverse permutation of CSA
LF Mapping
LPF Array
SAIS Array
LZ77 Fact
NSS
PSS
Lyndon Array
Lyndon Fact
lex-parse
Border Array
QuickArrays built the following data structures and factorizations for you:
character runs ( text: , bbwt: , bwt: ); #factors ( LZ77: , Lyndon: , lexparse: ) Exponent: ; Period: ; Typ:
The state of QuickArrays is stored in the URL.
By creating a bookmark, you can return to the current state at any time.
Questions or problems? Feel free to use our bug tracker, or drop Jonas or Dominik a mail.