Binary block order Rouen transform

DOI10.1016/j.tcs.2016.05.028zbMath1357.68153OpenAlexW2401222702MaRDI QIDQ507387

Yannick Guesnet, Richard Groult, Élise Prieur-Gaston, Thierry Lecroq, Arnaud Lefebvre, Jacqueline W. Daykin, Martine Léonard

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.028

zbMATH Keywords

lexicographic orderinverse transformBurrows-Wheeler transformdata clusteringsuffix arraybinary stringwordLyndon word\(B\)-wordbinary alphabetblock ordersuffix-sorting

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items

A survey of string orderings and their application to the Burrows-Wheeler transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
• A four-stage algorithm for updating a Burrows-Wheeler transform
• A note on the Burrows-Wheeler transformation
• Lyndon-like and V-order factorizations of strings
• A bijective variant of the Burrows-Wheeler transform using \(V\)-order
• Fast BWT in small space by blockwise suffix sorting
• Factorizing words over an ordered alphabet
• Linear work suffix array construction
• Space Efficient Linear Time Construction of Suffix Arrays
• Lightweight LCP Construction for Next-Generation Sequencing Datasets
• A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
• Algorithms on Strings
• Combinatorial Pattern Matching
• Free differential calculus. IV: The quotient groups of the lower central series