In-place bijective burrows-wheeler transforms

DOI10.4230/LIPICS.CPM.2020.21MaRDI QIDQ5874450OpenAlexFDO

Authors Dominik Käppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara

Publication date 7 February 2023

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

zbMATH Keywords

Lyndon wordsBurrows-Wheeler transformin-place algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(8)

• Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning
• Can formal languages help pangenomics to represent and analyze multiple genomes?
• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
• Constructing and indexing the bijective and extended Burrows-Wheeler transform
• Computing the Burrows-Wheeler transform in place and in small space
• A bijective variant of the Burrows-Wheeler transform using \(V\)-order
• FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
• Indexing the bijective BWT

This page was built for publication: In-place bijective burrows-wheeler transforms

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