Improved dynamic dictionary matching
From MaRDI portal
Publication:1893741
DOI10.1006/inco.1995.1090zbMath0832.68033OpenAlexW2025470700MaRDI QIDQ1893741
Martin Farach, Alejandro A. Schäffer, Johannes A. La Poutré, Ramana M. Idury, Amihood Amir
Publication date: 2 August 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1090
Related Items
Dynamic nested brackets, Position heaps for Cartesian-tree matching on strings and tries, Lempel Ziv Computation in Small Space (LZ-CISS), LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding, Dictionary Matching with Uneven Gaps, On updating suffix tree labels, Position-restricted substring searching over small alphabets, Mind the gap!, Pattern matching in hypertext, Time-Optimal Top-$k$ Document Retrieval, Online parameterized dictionary matching with one gap, Dictionary matching with a bounded gap in pattern or in text, Unnamed Item, Online recognition of dictionary with one gap, Parameterized dictionary matching and recognition with one gap, A grouping approach for succinct dynamic dictionary matching, On-line construction of two-dimensional suffix trees, PARENT QUERIES OVER DYNAMIC BALANCED PARENTHESIS STRINGS, On suffix extensions in suffix trees, A faster algorithm for matching a set of patterns with variable length don't cares, Lempel-Ziv factorization powered by space efficient suffix trees, Internal dictionary matching, Repetition Detection in a Dynamic String, Fast prefix matching of bounded strings, The matroid cup game, Dynamic dictionary matching in external memory, Efficient dynamic dictionary matching with DAWGs and AC-automata, The Online House Numbering Problem: Min-Max Online List Labeling, Dictionary matching with a few gaps, Constructing LZ78 tries and position heaps in linear time for large alphabets, Compressing dictionary matching index via sparsification technique, A comparative study of dictionary matching with gaps: limitations, techniques and challenges
