Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.

From MaRDI portal

Revision as of 00:38, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5369539

Jump to:navigation, search

DOI10.4230/LIPIcs.CPM.2016.6zbMath1380.68154OpenAlexW2556452783MaRDI QIDQ5369539

Ely Porat, Yaron Rozen, Tsvi Kopelowitz

Publication date: 17 October 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/cpm/cpm2016.html#KopelowitzPR16

zbMATH Keywords

labeled trees dictionary matching Aho-Corasick succinct indexing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items (6)

A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Compressed Multiple Pattern Matching ⋮ Streaming Dictionary Matching with Mismatches ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet ⋮ Streaming dictionary matching with mismatches

This page was built for publication: Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5369539&oldid=20081397"