Computing the Burrows-Wheeler transform of a string and its reverse in parallel
From MaRDI portal
Publication:2442813
DOI10.1016/j.jda.2013.06.002zbMath1284.68705OpenAlexW1971934753MaRDI QIDQ2442813
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
Publication date: 1 April 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.06.002
Searching and sorting (68P10) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)
Related Items (3)
Parallel lightweight wavelet tree, suffix array and FM-index construction ⋮ Tighter bounds for the sum of irreducible LCP values ⋮ \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the Burrows-Wheeler Transform of a String and Its Reverse
- Bidirectional Search in a String with Wavelet Trees
- Approximate All-Pairs Suffix/Prefix Overlaps
- Top-k Ranked Document Search in General Text Databases
- Permuted Longest-Common-Prefix Array
- Algorithms on Strings, Trees and Sequences
- Compressed suffix trees
- Algorithm Theory - SWAT 2004
This page was built for publication: Computing the Burrows-Wheeler transform of a string and its reverse in parallel