Improved dynamic dictionary matching

DOI10.1006/INCO.1995.1090MaRDI QIDQ1893741zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer

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

zbMATH Keywords

dynamic dictionary matching problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 437564
• Two-dimensional dynamic dictionary matching
• Dynamic dictionary matching in external memory

Cited in

(36)

• Two-dimensional dynamic dictionary matching
• Efficient dynamic dictionary matching with DAWGs and AC-automata
• Dictionary matching with a few gaps
• Dictionary matching with uneven gaps
• scientific article; zbMATH DE number 7765421 (Why is no real title available?)
• A comparative study of dictionary matching with gaps: limitations, techniques and challenges
• On updating suffix tree labels
• Dynamic nested brackets
• Online parameterized dictionary matching with one gap
• Online recognition of dictionary with one gap
• Parameterized dictionary matching and recognition with one gap
• On suffix extensions in suffix trees
• scientific article; zbMATH DE number 437564 (Why is no real title available?)
• Dynamic dictionary matching in external memory
• Mind the gap!
• A faster algorithm for matching a set of patterns with variable length don't cares
• Compressing dictionary matching index via sparsification technique
• Lempel-Ziv factorization powered by space efficient suffix trees
• Time-optimal top-\(k\) document retrieval
• LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding
• Dynamic text and static pattern matching.
• On the parallel dynamic dictionary matching problem: new results with applications
• Position heaps for Cartesian-tree matching on strings and tries
• Internal dictionary matching
• Lempel Ziv computation in small space (LZ-CISS)
• The online house numbering problem: min-max online list labeling
• On-line construction of two-dimensional suffix trees
• The matroid cup game
• Constructing LZ78 tries and position heaps in linear time for large alphabets
• Position-restricted substring searching over small alphabets
• Repetition Detection in a Dynamic String
• A grouping approach for succinct dynamic dictionary matching
• Fast prefix matching of bounded strings
• Dictionary matching with a bounded gap in pattern or in text
• Pattern matching in hypertext
• Parent queries over dynamic balanced parenthesis strings

This page was built for publication: Improved dynamic dictionary matching

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