The alternating BWT: an algorithmic perspective
From MaRDI portal
Publication:2297865
DOI10.1016/j.tcs.2019.11.002zbMath1435.68087arXiv1907.02308OpenAlexW2987532818WikidataQ126835263 ScholiaQ126835263MaRDI QIDQ2297865
Raffaele Giancarlo, Giovanna Rosone, Giovanni Manzini, Antonio Restivo, Marinella Sciortino
Publication date: 20 February 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.02308
Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items (2)
A new class of string transformations for compressed text indexing ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quorums from difference covers
- A bijection between words and multisets of necklaces
- Balancing and clustering of words in the Burrows-Wheeler transform
- On optimally partitioning a text to improve its compression
- Burrows-Wheeler transform and Sturmian words
- Words with simple Burrows-Wheeler transforms
- Long cycles in \(abc\)-permutations
- Lexicographically least circular substrings
- Counting permutations with given cycle structure and descent set
- Block sorting-based transformations on words: beyond the magic BWT
- The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform
- Wheeler graphs: a framework for BWT-based data structures
- Measuring the clustering effect of BWT via RLE
- Burrows-Wheeler transform and run-length enconding
- A note on the Burrows-Wheeler transformation
- Engineering a lightweight suffix array construction algorithm
- Distance measures for biological sequences: some recent approaches
- Burrows-Wheeler transform and palindromic richness
- On generalized Lyndon words
- 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
- Lightweight LCP construction for very large collections of strings
- Generalized Lyndon words
- An analysis of the Burrows—Wheeler transform
- Factorizing words over an ordered alphabet
- Linear work suffix array construction
- Boosting textual compression in optimal linear time
- Indexing compressed text
- Fast canonization of circular strings
- Algorithms on Strings, Trees and Sequences
- Optimal Lower and Upper Bounds for Representing Sequences
- A new class of searchable and provably highly compressible string transformations
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words
This page was built for publication: The alternating BWT: an algorithmic perspective
