Related references
Note: Only part of the references are listed.Grammar-compressed indexes with logarithmic search time
Francisco Claude et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2021)
Dynamic index and LZ factorization in compressed space
Takaaki Nishimoto et al.
DISCRETE APPLIED MATHEMATICS (2020)
Refining the r-index
Hideo Bannai et al.
THEORETICAL COMPUTER SCIENCE (2020)
Parallel computation of the Burrows Wheeler Transform in compact space
Jose Fuentes-Sepulveda et al.
THEORETICAL COMPUTER SCIENCE (2020)
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Travis Gagie et al.
JOURNAL OF THE ACM (2020)
Lempel-Ziv-Like Parsing in Small Space
Dmitry Kosolobov et al.
ALGORITHMICA (2020)
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment
Alan Kuhnle et al.
JOURNAL OF COMPUTATIONAL BIOLOGY (2020)
Universal compressed text indexing
Gonzalo Navarro et al.
THEORETICAL COMPUTER SCIENCE (2019)
Prefix-free parsing for building big BWTs
Christina Boucher et al.
ALGORITHMS FOR MOLECULAR BIOLOGY (2019)
Time-space trade-offs for Lempel-Ziv compressed indexing
Philip Bille et al.
THEORETICAL COMPUTER SCIENCE (2018)
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees
Johannes Fischer et al.
ALGORITHMICA (2018)
A faster implementation of online RLBWT and its application to LZ77 parsing
Tatsuya Ohno et al.
JOURNAL OF DISCRETE ALGORITHMS (2018)
LZ77 Computation Based on the Run-Length Encoded BWT
Alberto Policriti et al.
ALGORITHMICA (2018)
TIME-OPTIMAL TOP-k DOCUMENT RETRIEVAL
Gonzalo Navarro et al.
SIAM JOURNAL ON COMPUTING (2017)
Universal indexes for highly repetitive document collections
Francisco Claude et al.
INFORMATION SYSTEMS (2016)
A really simple approximation of smallest grammar
Artur Jez
THEORETICAL COMPUTER SCIENCE (2016)
Burrows-Wheeler transform for terabases
Jouni Siren
2016 DATA COMPRESSION CONFERENCE (DCC) (2016)
Approximation of grammar-based compression via recompression
Artur Jez
THEORETICAL COMPUTER SCIENCE (2015)
Searching and indexing genomic databases via kernelization
Travis Gagie et al.
FRONTIERS IN BIOENGINEERING AND BIOTECHNOLOGY (2015)
Time-space trade-offs for longest common extensions
Philip Bille et al.
JOURNAL OF DISCRETE ALGORITHMS (2014)
On compressing and indexing repetitive sequences
Sebastian Kreft et al.
THEORETICAL COMPUTER SCIENCE (2013)
ESP-index: A compressed index based on edit-sensitive parsing
Shirou Maruyama et al.
JOURNAL OF DISCRETE ALGORITHMS (2013)
Lightweight Data Indexing and Compression in External Memory
Paolo Ferragina et al.
ALGORITHMICA (2012)
An Online Algorithm for Lightweight Grammar-Based Compression
Shirou Maruyama et al.
ALGORITHMS (2012)
SPACE-EFFICIENT PREPROCESSING SCHEMES FOR RANGE MINIMUM QUERIES ON STATIC ARRAYS
Johannes Fischer et al.
SIAM JOURNAL ON COMPUTING (2011)
A quick tour on suffix arrays and compressed suffix arrays
Roberto Grossi
THEORETICAL COMPUTER SCIENCE (2011)
Effective content-based video retrieval using pattern-indexing and matching techniques
Ja-Hwung Su et al.
EXPERT SYSTEMS WITH APPLICATIONS (2010)
Storage and Retrieval of Highly Repetitive Sequence Collections
Veli Makinen et al.
JOURNAL OF COMPUTATIONAL BIOLOGY (2010)
Mining Query Logs: Turning Search Usage Data into Knowledge
F. Silvestri
Foundations and Trends in Information Retrieval (2010)
Sourcerer: mining and searching internet-scale software repositories
Erik Linstead et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2009)
BREAKING A TIME-AND-SPACE BARRIER IN CONSTRUCTING FULL-TEXT INDICES
Wing-Kai Hon et al.
SIAM JOURNAL ON COMPUTING (2009)
Lempel-Ziv Factorization Using Less Time & Space
Gang Chen et al.
MATHEMATICS IN COMPUTER SCIENCE (2008)
Fast BWT in small space by blockwise suffix sorting
Juha Karkkainen
THEORETICAL COMPUTER SCIENCE (2007)
A space and time efficient algorithm for constructing compressed suffix arrays
Wing-Kai Hon et al.
ALGORITHMICA (2007)
Linear work suffix array construction
Juha Karkkainen et al.
JOURNAL OF THE ACM (2006)
Indexing compressed text
P Ferragina et al.
JOURNAL OF THE ACM (2005)
A fully linear-time approximation algorithm for grammar-based compression
Hiroshi Sakamoto
JOURNAL OF DISCRETE ALGORITHMS (2005)
Space efficient linear time construction of suffix arrays
Pang Ko et al.
JOURNAL OF DISCRETE ALGORITHMS (2005)
Constructing suffix arrays in linear time
Dong Kyue Kim et al.
JOURNAL OF DISCRETE ALGORITHMS (2005)
Off-line dictionary-based compression
NJ Larsson et al.
PROCEEDINGS OF THE IEEE (2000)
On the sorting-complexity of suffix tree construction
M Farach-Colton et al.
JOURNAL OF THE ACM (2000)
Share Paper
