Faster average case low memory semi-external construction of the Burrows-Wheeler transform

DOI10.1007/S11786-017-0296-2zbMath1370.68344arXiv1604.06687OpenAlexW2294406848WikidataQ59528685 ScholiaQ59528685MaRDI QIDQ2363991

German Tischler

Publication date: 17 July 2017

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

Full work available at URL: https://arxiv.org/abs/1604.06687

zbMATH Keywords

Burrows-Wheeler transformparallel index constructionsemi-external algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Practical Wavelet Tree Construction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the height of digital trees and related problems
• Engineering a lightweight external memory suffix array construction algorithm
• Lightweight data indexing and compression in external memory
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Linear work suffix array construction
• Universal codeword sets and representations of the integers
• Fast Pattern Matching in Strings
• A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
• Inducing Suffix and LCP Arrays in External Memory
• Better external memory suffix array construction
• Two Efficient Algorithms for Linear Time Suffix Array Construction
• Algorithms on Strings

This page was built for publication: Faster average case low memory semi-external construction of the Burrows-Wheeler transform