QuickArrays

Choose your data structures and factorizations (drag and drop or double-click):
You can use drag and drop to reorder your selection!
Enabled:
TInput text
iIndex Array
SASuffix Array
String transforms:
Index permutations:
Length arrays:
Factorizations:
Other:
ΓLeftmost Smallest String Attractor
ΦPhi Array
Φ⁻¹Inverse Phi Array
ΨPsi Array
BBorder Array
BBWTBijective Burrows-Wheeler Transform
BBWT⁻¹Inverse Bijective Burrows-Wheeler Transform
BBWTiText-Indices of the Bijective Burrows-Wheeler Transform
BWTBurrows-Wheeler Transform
CISAInverse Circular Suffix Array
CSACircular Suffix Array
e-paliEven Maximal Palindromic Length Array
FFirst Column Array
inv(T)Inverts a string by mapping each character to its complementary character
ISAInverse Suffix Array
LCPLongest Common Prefix array
LexParseLexicographic Parse Factorization
LFLast-to-First Mapping Array
LNFLongest Next Factor array
LPFLongest Previous Factor array
LPnFLongest Previous Non-Overlapping Factor array
LyndonLyndon Array
LynFLyndon Factorization
LZ77LZ77 Factorization
LZ78LZ78 Factorization
LZendLZ-end Factorization
LZSSLZSS Factorization
LZSSnoLZSS non-overlapping Factorization
LZWLZW Factorization
min-rot(T)Lexicographically smallest conjugate of a given string.
NeckFNecklace Factorization
NSSNext Smaller Suffix Array
o-paliOdd Maximal Palindromic Length Array
PLCPPermuted Longest Common Prefix array
PSSPrevious Smaller Suffix Array
rev(T)Reverts a string by reading it backwards
rLZSSReverse LZSS Factorization
RotRotation Array
S/LS/L SAIS type string
SCSubstring Complexity Array
QuickArrays built the following data structures and factorizations for you in :
Choose your counters .
Enabled:
nLength of the text
σEffective alphabet size
runs(T)Size of run-length encoding of the input text
Other counters:
Size of run length encoding:
Number of factors:
eExponent
max δSubstring Complexity Measure Length
pShortest Period
RRegularity Type
runs(BBWT)Bijective Burrows-Wheeler Transform
runs(BBWT⁻¹)Inverse Bijective Burrows-Wheeler Transform
runs(BWT)Burrows-Wheeler Transform
runs(inv(T))Inverts a string by mapping each character to its complementary character
runs(min-rot(T))Lexicographically smallest conjugate of a given string.
runs(rev(T))Reverts a string by reading it backwards
size(LexParse)Lexicographic Parse Factorization
size(LynF)Lyndon Factorization
size(LZ77)LZ77 Factorization
size(LZ78)LZ78 Factorization
size(LZend)LZ-end Factorization
size(LZSS)LZSS Factorization
size(LZSSno)LZSS non-overlapping Factorization
size(LZW)LZW Factorization
size(NeckF)Necklace Factorization
size(rLZSS)Reverse LZSS Factorization
size(Γ)Leftmost Smallest String Attractor
δSubstring Complexity Measure
Σ LCPSum of LCP array values
3
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. Like it? Cite us and give us a star on GitHub!
×

title

content