An improved query time for succinct dynamic dictionary matching

DOI10.1007/978-3-319-07566-2_13MaRDI QIDQ5165598zbMATH OpenOpenAlexFDO

Authors Guy Feigenblat, Ely Porat, Ariel Shiftan

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_13

Mathematics Subject Classification ID

Data structures (68P05) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• A grouping approach for succinct dynamic dictionary matching
• Succinct Dictionary Matching with No Slowdown
• Efficient dynamic dictionary matching with DAWGs and AC-automata
• scientific article; zbMATH DE number 437564
• Succinct 2D dictionary matching

Cited in

(11)

• Dictionary matching with a bounded gap in pattern or in text
• Efficient dynamic dictionary matching with DAWGs and AC-automata
• Succinct 2D dictionary matching
• Dictionary matching with uneven gaps
• Indexing a Dictionary for Subset Matching Queries
• Succinct Dictionary Matching with No Slowdown
• A high-speed dynamic full-text search method by using memory management
• Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
• Real-Time Streaming Multi-Pattern Search for Constant Alphabet
• A grouping approach for succinct dynamic dictionary matching
• Succinct online dictionary matching with improved worst-case guarantees

This page was built for publication: An improved query time for succinct dynamic dictionary matching

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