Efficient Preprocessing of Simple Binary Pattern Forests

DOI10.1006/JAGM.1996.0029MaRDI QIDQ4881410zbMATH OpenOpenAlexFDO

Authors Mikkel Thorup

Publication date 11 December 1996

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

Full work available at URL https://doi.org/10.1006/jagm.1996.0029

zbMATH Keywords

multipattern matching

Mathematics Subject Classification ID

Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient preprocessing of simple binary pattern forests
• More efficient bottom-up multi-pattern matching in trees
• scientific article; zbMATH DE number 125882

Cited in

(3)

• scientific article; zbMATH DE number 3852455 (Why is no real title available?)
• scientific article; zbMATH DE number 125882 (Why is no real title available?)
• Efficient preprocessing of simple binary pattern forests

This page was built for publication: Efficient Preprocessing of Simple Binary Pattern Forests

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