Burrows-Wheeler transformations and de Bruijn words
From MaRDI portal
Publication:714849
DOI10.1016/J.TCS.2012.07.019zbMATH Open1278.68238arXiv1901.08392OpenAlexW1968236325MaRDI QIDQ714849FDOQ714849
Authors: Peter M. Higgins 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: We formulate and explain the extended Burrows-Wheeler transform of Mantaci et al from the viewpoint of permutations on a chain taken as a union of partial order-preserving mappings. In so doing we establish a link with syntactic semigroups of languages that are themselves cyclic semigroups. We apply the extended transform with a view to generating de Bruijn words through inverting the transform.
Full work available at URL: https://arxiv.org/abs/1901.08392
Recommendations
- scientific article; zbMATH DE number 2051173
- An extension of the Burrows-Wheeler transform
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Words with simple Burrows-Wheeler transforms
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Title not available (Why is that?)
- Counting permutations with given cycle structure and descent set
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- On the theorem of Fredricksen and Maiorana about de Bruijn sequences
- A note on the Burrows-Wheeler transformation
- An extension of the Burrows-Wheeler transform
- THE SEMIGROUP OF CONJUGATES OF A WORD
Cited In (15)
- String inference from longest-common-prefix array
- Words with simple Burrows-Wheeler transforms
- Title not available (Why is that?)
- A bijection between words and multisets of necklaces
- FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
- An extension of the Burrows-Wheeler transform
- Burrows-Wheeler transform and run-length enconding
- Measuring the clustering effect of BWT via RLE
- Tighter bounds for the sum of irreducible LCP values
- Tighter bounds for the sum of irreducible LCP values
- On semi-perfect de Bruijn words
- Regular Transformations of Data Words Through Origin Information
- Computing the Burrows-Wheeler Transform of a String and Its Reverse
- A BWT-based algorithm for random de Bruijn sequence construction
- Sorting conjugates and suffixes of words in a multiset
This page was built for publication: Burrows-Wheeler transformations and de Bruijn words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714849)
