Counting permutations with given cycle structure and descent set
Journal of Combinatorial Theory Series A
Block edit models for approximate string matching
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Structuring labeled trees for optimal succinctness, and beyond
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A note on the Burrows-Wheeler transformation
Theoretical Computer Science
A New Combinatorial Approach to Sequence Comparison
Theory of Computing Systems
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Distance measures for biological sequences: Some recent approaches
International Journal of Approximate Reasoning
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Lightweight BWT construction for very large string collections
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A bijection between words and multisets of necklaces
European Journal of Combinatorics
Burrows-Wheeler transformations and de Bruijn words
Theoretical Computer Science
Efficient algorithm for circular burrows-wheeler transform
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Comparing DNA sequence collections by direct comparison of compressed text indexes
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Lightweight LCP construction for next-generation sequencing datasets
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Lightweight algorithms for constructing and inverting the BWT of string collections
Theoretical Computer Science
Hi-index | 5.23 |
We describe and highlight a generalization of the Burrows-Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A^*. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.