Faster compressed dictionary matching

DOI10.1016/j.tcs.2012.10.050zbMath1259.68259OpenAlexW1993868627MaRDI QIDQ1939285

Wing-Kai Hon, Sharma V. Thankachan, Rahul Shah, Jeffrey Scott Vitter, Tsung-Han Ku

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.050

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (16)

Approximating LZ77 via Small-Space Multiple-Pattern Matching ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Dictionary Matching with Uneven Gaps ⋮ Compressed indexes for text with wildcards ⋮ Unnamed Item ⋮ Compressed text indexing with wildcards ⋮ Fast circular dictionary-matching algorithm ⋮ Dictionary matching with a bounded gap in pattern or in text ⋮ Searching and Indexing Circular Patterns ⋮ A grouping approach for succinct dynamic dictionary matching ⋮ On the Hardness and Inapproximability of Recognizing Wheeler Graphs ⋮ Compressed Multiple Pattern Matching ⋮ Streaming Dictionary Matching with Mismatches ⋮ Compressing dictionary matching index via sparsification technique ⋮ On the complexity of recognizing Wheeler graphs ⋮ Streaming dictionary matching with mismatches

This page was built for publication: Faster compressed dictionary matching