Efficient algorithm for circular Burrows-Wheeler transform

DOI10.1007/978-3-642-31265-6_21zbMATH Open1358.68341OpenAlexW1950227463MaRDI QIDQ2904499FDOQ2904499

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

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

Recommendations

• Succinct indexes for circular patterns
• Fast circular dictionary-matching algorithm
• Space-efficient construction algorithm for the circular suffix tree
• Average linear time and compressed space construction of the Burrows-Wheeler transform
• Faster average case low memory semi-external construction of the Burrows-Wheeler transform

Mathematics Subject Classification ID

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

Cited In (11)

• Indexing Circular Patterns
• The Burrows-Wheeler transform between data compression and combinatorics on words
• Lightweight merging of compressed indices based on BWT variants
• Space-efficient construction algorithm for the circular suffix tree
• Computing the original eBWT faster, simpler, and with less memory
• r-indexing the eBWT
• Fast circular dictionary-matching algorithm
• Constructing and indexing the bijective and extended Burrows-Wheeler transform
• Succinct indexes for circular patterns
• \(r\)-indexing the eBWT
• A new class of string transformations for compressed text indexing

This page was built for publication: Efficient algorithm for circular Burrows-Wheeler transform

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