Indexing the bijective BWT

DOI10.4230/LIPIcs.CPM.2019.17OpenAlexW2955867452MaRDI QIDQ5088907

Hideo Bannai, Dominik Köppl, Marcin Piątkowski, Juha Kärkkäinen

Publication date: 18 July 2022

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2019/10488/pdf/LIPIcs-CPM-2019-17.pdf/

zbMATH Keywords

Burrows-Wheeler transformLyndon wordstext indexing

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (3)

Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ A new class of string transformations for compressed text indexing ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform

Cites Work

• Unnamed Item
• Unnamed Item
• Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
• A faster implementation of online run-length Burrows-Wheeler transform
• Fragmented BWT: an extended BWT for full-text indexing
• An extension of the Burrows-Wheeler transform
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Factorizing words over an ordered alphabet
• Indexing compressed text
• On Undetected Redundancy in the Burrows-Wheeler Transform
• Optimal Dynamic Sequence Representations
• SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET
• On Burnside's Problem
• Free differential calculus. IV: The quotient groups of the lower central series

This page was built for publication: Indexing the bijective BWT