Distribution-aware compressed full-text indexes
type: Item
instance of: scholarly article
title: Distribution-aware compressed full-text indexes
zbMATH Open document ID: 1308.68058
author: Paolo Ferragina
author: Jouni Sirén
author: Rossano Venturini
published in: Algorithmica
publication date: 2015-03-23T00:00:00Z
full work available at URL: http://hdl.handle.net/10138/27658
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U15
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6418587
zbMATH Keywords: full-text indexing
zbMATH Keywords: compressed full-text indexes
zbMATH Keywords: succinct data structures
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
OpenAlex ID: W2593228764
cites work: Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
cites work: Alphabet Partitioning for Compressed Rank/Select and Applications
cites work: Alphabet-Independent Compressed Text Indexing
cites work: Mining Query Logs: Turning Search Usage Data into Knowledge
cites work: Indexing compressed text
cites work: Compressed text indexes
cites work: Distribution-Aware Compressed Full-Text Indexes
cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Q4471381
cites work: Q2762514
cites work: The Least Weight Subsequence Problem
cites work: Compressed representations of sequences and full-text indexes
cites work: New text indexing functionalities of the compressed suffix arrays
cites work: Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
cites work: The concave least-weight subsequence problem revisited
DOI: 10.1007/S00453-013-9782-3
description: scientific article; zbMATH DE number 6418587