Reverse-safe data structures for text indexing

DOI10.1137/1.9781611976007.16MaRDI QIDQ5147513zbMATH OpenOpenAlexFDO

Authors Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611976007.16

Mathematics Subject Classification ID

Data structures (68P05) Privacy of data (68P27)

Recommendations

• Reverse-safe text indexing
• Anti-persistence
• New text indexing functionalities of the compressed suffix arrays
• Computationally secure pattern matching in the presence of malicious adversaries
• Complete inverted files for efficient text retrieval and analysis

Cited in

(7)

• Beyond the BEST theorem: fast assessment of Eulerian trails
• Reverse-safe text indexing
• Bounding the number of Eulerian tours in undirected graphs
• Refined bounds on the number of Eulerian tours in undirected graphs
• Connecting de Bruijn graphs
• On strings having the same length-k substrings
• When is string reconstruction using de Bruijn graphs hard?

This page was built for publication: Reverse-safe data structures for text indexing

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