String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
Burrows–Wheeler transform (BWT) is an invertible text transformation that, given a text T of length n, permutes its symbols according to the lexicographic order of suffixes of T. BWT is one of the most heavily studied algorithms in data compression with numerous applications in indexing, sequence analysis, and bioinformatics. Its …