Flexible indexing of repetitive collections
type: Item
instance of: scholarly article
title: Flexible indexing of repetitive collections
zbMATH Open document ID: 1489.68056
DOI: 10.1007/978-3-319-58741-7_17
author: Fabio Cunial
author: Travis Gagie
author: Nicola Prezza
author: Djamal Belazzougui
author: Mathieu Raffinot
publication date: 2017-08-04T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6756759
describes a project that uses: PATRICIA
MaRDI profile type: Publication
OpenAlex ID: W2614020870
cites work: Stronger Lempel-Ziv based compressed text indexing
cites work: Linear time construction of compressed text indices in compact space
cites work: Composite Repetition-Aware Data Structures
cites work: Orthogonal range searching on the RAM, revisited
cites work: The Complexity of Some Simple Retrieval Problems
cites work: Indexing compressed text
cites work: LZ77-Based Self-indexing with Faster Pattern Matching
cites work: Algorithms on Strings, Trees and Sequences
cites work: Self-indexing Based on LZ77
cites work: On compressing and indexing repetitive sequences
cites work: Combinatorial Pattern Matching
cites work: Succinct representation of balanced parentheses and static trees
cites work: On maximal repeats in strings
cites work: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
cites work: Log-logarithmic worst-case range queries are possible in space theta(N)
cites work: A universal algorithm for sequential data compression
description: scientific article; zbMATH DE number 6756759