Dynamic dictionary matching with failure functions

DOI10.1016/0304-3975(94)90176-7zbMath0938.68957OpenAlexW2118754356MaRDI QIDQ1331942

Ramana M. Idury, Alejandro A. Schäffer

Publication date: 26 February 1996

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90176-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (6)

On updating suffix tree labels ⋮ Matching a set of strings with variable length don't cares ⋮ Multiple matching of parameterized patterns ⋮ Repetition Detection in a Dynamic String ⋮ Dynamic dictionary matching in external memory ⋮ Efficient dynamic dictionary matching with DAWGs and AC-automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-dimensional dictionary matching
• Dynamic dictionary matching
• A fast string searching algorithm
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings

This page was built for publication: Dynamic dictionary matching with failure functions