Computing the Burrows-Wheeler Transform of a String and Its Reverse

DOI10.1007/978-3-642-31265-6_20MaRDI QIDQ2904497zbMATH OpenOpenAlexFDO

Authors Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda

Publication date 14 August 2012

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31265-6_20

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• Computing the Burrows-Wheeler transform of a string and its reverse in parallel
• FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
• Burrows-Wheeler transform and run-length enconding
• Burrows-Wheeler transformations and de Bruijn words
• Burrows-Wheeler transform and palindromic richness
• An extension of the Burrows-Wheeler transform
• Computing the Burrows-Wheeler transform in place and in small space
• A survey of string orderings and their application to the Burrows-Wheeler transform
• A note on the Burrows-Wheeler transformation
• An analysis of the Burrows-Wheeler transform

Cited in

(5)

• Burrows-Wheeler transform and run-length enconding
• Computing the Burrows-Wheeler transform of a string and its reverse in parallel
• FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
• Computing Burrows-Wheeler similarity distributions for string collections
• Novel results on the number of runs of the Burrows-Wheeler-transform

This page was built for publication: Computing the Burrows-Wheeler Transform of a String and Its Reverse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904497)