SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET

DOI10.1142/S0129054114400309zbMath1310.68172MaRDI QIDQ5247182

Giovanna Rosone, Silvia Bonomo, Marinella Sciortino, Antonio Restivo, Sabrina Mantaci

Publication date: 23 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

sortingBurrows-Wheeler transformcircular wordsLyndon wordsconjugatesextended Burrows-Wheeler transformsuffixes

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (8)

On generalized Lyndon words ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ A combinatorial view on string attractors ⋮ When a dollar makes a BWT ⋮ Unnamed Item ⋮ Lightweight merging of compressed indices based on BWT variants ⋮ The alternating BWT: an algorithmic perspective ⋮ Indexing the bijective BWT

Cites Work

• Lightweight algorithms for constructing and inverting the BWT of string collections
• Counting permutations with given cycle structure and descent set
• A note on the Burrows-Wheeler transformation
• From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
• An extension of the Burrows-Wheeler transform
• A new combinatorial approach to sequence comparison
• Factorizing words over an ordered alphabet

This page was built for publication: SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET