r-indexing the eBWT - MaRDI portal

Cites work

scientific article; zbMATH DE number 1737190 (Why is no real title available?)
scientific article; zbMATH DE number 1786458 (Why is no real title available?)
scientific article; zbMATH DE number 6850405 (Why is no real title available?)
scientific article; zbMATH DE number 2226805 (Why is no real title available?)
scientific article; zbMATH DE number 7695999 (Why is no real title available?)
A theoretical and experimental analysis of BWT variants for string collections
An extension of the Burrows-Wheeler transform
Computing the original eBWT faster, simpler, and with less memory
Counting permutations with given cycle structure and descent set
Efficient algorithm for circular Burrows-Wheeler transform
Experimental algorithms. 15th international symposium, SEA 2016, St. Petersburg, Russia, June 5--8, 2016. Proceedings
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
Fully functional suffix trees and optimal text searching in BWT-runs bounded space
Grammar-compressed indexes with logarithmic search time
Hybrid indexing revisited
Indexing compressed text
Indexing the bijective BWT
LZ77 computation based on the run-length encoded BWT
On compressing and indexing repetitive sequences
On the combinatorics of suffix arrays
Optimal lower and upper bounds for representing sequences
Permuted Longest-Common-Prefix Array
Refining the \(r\)-index
Space-efficient preprocessing schemes for range minimum queries on static arrays
Suffix Arrays: A New Method for On-Line String Searches
Two Efficient Algorithms for Linear Time Suffix Array Construction
r-indexing the eBWT

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

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