A note on the Burrows-Wheeler transformation
From MaRDI portal
Publication:1770410
DOI10.1016/j.tcs.2004.11.014zbMath1070.68126OpenAlexW2011856243WikidataQ61677938 ScholiaQ61677938MaRDI QIDQ1770410
Dominique Perrin, Maxime Crochemore, Désarménien, Jacques
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.11.014
Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (27)
Indeterminate string factorizations and degenerate text transformations ⋮ The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform ⋮ Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ A linear partitioning algorithm for hybrid Lyndons using \(V\)-order ⋮ A new class of string transformations for compressed text indexing ⋮ A survey of string orderings and their application to the Burrows-Wheeler transform ⋮ Sturmian and Episturmian Words ⋮ A bijection between words and multisets of necklaces ⋮ A bijective variant of the Burrows-Wheeler transform using \(V\)-order ⋮ On the combinatorics of suffix arrays ⋮ When a dollar makes a BWT ⋮ Counting suffix arrays and strings ⋮ An extension of the Burrows-Wheeler transform ⋮ Two Combinatorial Criteria for BWT Images ⋮ Binary block order Rouen transform ⋮ String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time ⋮ Generic Algorithms for Factoring Strings ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ A new combinatorial approach to sequence comparison ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Burrows-Wheeler transformations and de Bruijn words ⋮ A four-stage algorithm for updating a Burrows-Wheeler transform ⋮ Inverse Lyndon words and inverse Lyndon factorizations of words ⋮ The alternating BWT: an algorithmic perspective ⋮ A new class of searchable and provably highly compressible string transformations ⋮ SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET
Cites Work
- Unnamed Item
- Unnamed Item
- Burrows-Wheeler transform and Sturmian words
- Counting permutations with given cycle structure and descent set
- An analysis of the Burrows—Wheeler transform
- Linear-Time Construction of Suffix Arrays
- Space Efficient Linear Time Construction of Suffix Arrays
- Words over an ordered alphabet and suffix permutations
- Mathematical Foundations of Computer Science 2003
This page was built for publication: A note on the Burrows-Wheeler transformation
