On Hardness of Several String Indexing Problems

DOI10.1007/978-3-319-07566-2_25zbMath1407.68229OpenAlexW2176225957MaRDI QIDQ5165610

Jesper Sindahl Nielsen, Kasper Green Larsen, J. Ian Munro, Sharma V. Thankachan

Publication date: 30 June 2014

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07566-2_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)

Related Items (6)

Space-efficient indexes for forbidden extension queries ⋮ Ranked Document Retrieval with Forbidden Pattern ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Ranked document retrieval for multiple patterns ⋮ On hardness of several string indexing problems

This page was built for publication: On Hardness of Several String Indexing Problems