Text sparsification via local maxima.

DOI10.1016/S0304-3975(03)00142-7zbMath1044.68032MaRDI QIDQ1401406

Roberto Grossi, Elena Lodi, Gianluca Rossi, Pierluigi Crescenzi, Linda Pagli, Alberto del Lungo

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-completenessComputational complexityPattern matchingString algorithmsText indexing data structures

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Maintaining dynamic sequences under equality tests in polylogarithmic time
• Symmetry breaking for suffix tree construction
• Suffix Arrays: A New Method for On-Line String Searches
• Deterministic coin tossing with applications to optimal parallel list ranking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Text sparsification via local maxima.