Text sparsification via local maxima.

DOI10.1016/S0304-3975(03)00142-7MaRDI QIDQ1401406zbMATH OpenFDO

Authors Roberto Grossi, Elena Lodi, Gianluca Rossi, Pilu Crescenzi, A. Del Lungo, L. Pagli

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)

Recommendations

• scientific article; zbMATH DE number 2080210
• Sparse text indexing in small space
• scientific article; zbMATH DE number 432798
• Faster sparse suffix sorting
• In-place sparse suffix sorting

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2080210 (Why is no real title available?)
• scientific article; zbMATH DE number 1445304 (Why is no real title available?)
• scientific article; zbMATH DE number 1445383 (Why is no real title available?)
• Deterministic coin tossing with applications to optimal parallel list ranking
• Maintaining dynamic sequences under equality tests in polylogarithmic time
• Suffix Arrays: A New Method for On-Line String Searches
• Symmetry breaking for suffix tree construction

Cited in

(1)

• scientific article; zbMATH DE number 2080210 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401406)