r-indexing the eBWT

DOI10.1007/978-3-030-86692-1_1OpenAlexW3202832737MaRDI QIDQ2146118

Christina Boucher, Zsuzsanna Lipták, Massimiliano Rossi, Davide Cenzato, Marinella Sciortino

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86692-1_1

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items (2)

A new class of string transformations for compressed text indexing ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform

Uses Software

• BWA
• r-index
• Big-BWT
• MONI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LZ77 computation based on the run-length encoded BWT
• Counting permutations with given cycle structure and descent set
• Computing the original eBWT faster, simpler, and with less memory
• Refining the \(r\)-index
• On the combinatorics of suffix arrays
• An extension of the Burrows-Wheeler transform
• Efficient Algorithm for Circular Burrows-Wheeler Transform
• Suffix Arrays: A New Method for On-Line String Searches
• Permuted Longest-Common-Prefix Array
• Optimal Lower and Upper Bounds for Representing Sequences
• Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
• Two Efficient Algorithms for Linear Time Suffix Array Construction

This page was built for publication: r-indexing the eBWT