Efficient Algorithm for Circular Burrows-Wheeler Transform

DOI10.1007/978-3-642-31265-6_21zbMath1358.68341OpenAlexW1950227463MaRDI QIDQ2904499

Sharma V. Thankachan, Chen-Hua Lu, Tsung-Han Ku, Rahul Shah, Wing-Kai Hon

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_21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (6)

r-indexing the eBWT ⋮ Computing the original eBWT faster, simpler, and with less memory ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ A new class of string transformations for compressed text indexing ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ Lightweight merging of compressed indices based on BWT variants

This page was built for publication: Efficient Algorithm for Circular Burrows-Wheeler Transform