A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
From MaRDI portal
Publication:4928562
DOI10.1007/978-3-642-38905-4_9zbMath1381.68313OpenAlexW65631664MaRDI QIDQ4928562
Roberto Grossi, Gad M. Landau, Maxime Crochemore, Juha Kärkkäinen
Publication date: 14 June 2013
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38905-4_9
Related Items (9)
Faster average case low memory semi-external construction of the Burrows-Wheeler transform ⋮ Indeterminate string factorizations and degenerate text transformations ⋮ Suffix array and Lyndon factorization of a text ⋮ A survey of string orderings and their application to the Burrows-Wheeler transform ⋮ A bijective variant of the Burrows-Wheeler transform using \(V\)-order ⋮ Full-Text Indexes for High-Throughput Sequencing ⋮ Binary block order Rouen transform ⋮ A simple algorithm for computing the document array ⋮ Computing the Burrows-Wheeler transform in place and in small space
This page was built for publication: A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
