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

DOI10.1007/978-3-642-31265-6_20zbMath1358.68346OpenAlexW122623111MaRDI QIDQ2904497

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Timo Beller

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)

Related Items (1)

Computing the Burrows-Wheeler transform of a string and its reverse in parallel

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