Constructing and indexing the bijective and extended Burrows-Wheeler transform
From MaRDI portal
Publication:6204171
DOI10.1016/j.ic.2024.105153MaRDI QIDQ6204171
Hideo Bannai, Dominik Köppl, Juha Kärkkäinen, Marcin Piątkowski
Publication date: 27 March 2024
Published in: Information and Computation (Search for Journal in Brave)
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Suffix array and Lyndon factorization of a text
- A bijection between words and multisets of necklaces
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Counting permutations with given cycle structure and descent set
- A faster implementation of online run-length Burrows-Wheeler transform
- Burrows-Wheeler transform and run-length enconding
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Fragmented BWT: an extended BWT for full-text indexing
- r-indexing the eBWT
- Computing the original eBWT faster, simpler, and with less memory
- The alternating BWT: an algorithmic perspective
- Nyldon words
- On generalized Lyndon words
- An extension of the Burrows-Wheeler transform
- Space efficient linear time construction of suffix arrays
- Generalized Lyndon words
- Efficient Algorithm for Circular Burrows-Wheeler Transform
- Succinct Indexes for Circular Patterns
- Suffix Arrays: A New Method for On-Line String Searches
- 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
- Optimal Lower and Upper Bounds for Representing Sequences
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Indexing the bijective BWT
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Uniqueness Theorems for Periodic Functions
- Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.
- On Burnside's Problem
- In-place bijective burrows-wheeler transforms
- Free differential calculus. IV: The quotient groups of the lower central series
- Lyndon Words Accelerate Suffix Sorting.
- Efficient construction of the BWT for repetitive text using string compression
- Optimal in-place suffix sorting
This page was built for publication: Constructing and indexing the bijective and extended Burrows-Wheeler transform