Counting permutations with given cycle structure and descent set
Journal of Combinatorial Theory Series A
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
An extension of the Burrows–Wheeler Transform
Theoretical Computer Science
Counting suffix arrays and strings
Theoretical Computer Science
A four-stage algorithm for updating a Burrows-Wheeler transform
Theoretical Computer Science
Combinatorics of Unique Maximal Factorization Families (UMFFs)
Fundamenta Informaticae - Special Issue on Stringology
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Two combinatorial criteria for BWT images
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
A new combinatorial approach to sequence comparison
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Counting suffix arrays and strings
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A bijection between words and multisets of necklaces
European Journal of Combinatorics
Burrows-Wheeler transformations and de Bruijn words
Theoretical Computer Science
Combinatorics of Unique Maximal Factorization Families (UMFFs)
Fundamenta Informaticae - Special Issue on Stringology
A linear partitioning algorithm for Hybrid Lyndons using V-order
Theoretical Computer Science
On the combinatorics of suffix arrays
Information Processing Letters
Generic algorithms for factoring strings
Information Theory, Combinatorics, and Search Theory
| Hi-index | 5.23 |
We relate the Burrows-Wheeler transformation with a result in combinatorics on words known as the Gessel-Reutenauer transformation.