Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries

DOI10.1006/JAGM.1995.1011MaRDI QIDQ4327823zbMATH OpenOpenAlexFDO

Authors Dany Breslauer

Publication date 26 February 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00070010/file/RT-0159.pdf

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited in

(2)

• On updating suffix tree labels
• Dynamic dictionary matching in external memory

This page was built for publication: Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries

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