Text sparsification via local maxima.
type: Item
instance of: scholarly article
title: Text sparsification via local maxima.
zbMATH Open document ID: 1044.68032
DOI: 10.1016/S0304-3975(03)00142-7
author: Roberto Grossi
author: Elena Lodi
author: Gianluca Rossi
author: Pilu Crescenzi
author: A. Del Lungo
author: L. Pagli
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1965403
zbMATH Keywords: Computational complexity
zbMATH Keywords: NP-completeness
zbMATH Keywords: Pattern matching
zbMATH Keywords: String algorithms
zbMATH Keywords: Text indexing data structures
MaRDI profile type: Publication
cites work: Q4952706
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Q4952617
cites work: Q4472452
cites work: Q4198056
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Maintaining dynamic sequences under equality tests in polylogarithmic time
cites work: Symmetry breaking for suffix tree construction
description: scientific article; zbMATH DE number 1965403