Tuning string matching for huge pattern sets

DOI10.1007/3-540-44888-8_16MaRDI QIDQ3550837zbMATH OpenOpenAlexFDO

Authors Jari Kytöjoki, Leena Salmela, Jorma Tarhio

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_16

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Multipattern string matching with q -grams
• Fast exact string matching algorithms
• Multiple approximate string matching
• Fast string matching for multiple searches
• New and faster filters for multiple approximate string matching

Cited in

(13)

• Efficient pattern searching over large dictionaries
• Bouma2 -- a high-performance input-aware multiple string-match algorithm
• Fast exact string matching algorithms
• Shift-or string matching with super-alphabets
• Exact pattern matching with feed-forward Bloom filters
• Exact pattern matching with feed-forward Bloom filters
• The exact multiple pattern matching problem solved by a reference tree approach
• Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm
• String Processing and Information Retrieval
• Efficient log filter
• Multipattern string matching with q -grams
• Multi-pattern matching algorithms and hardware based implementation
• Faster string matching based on hashing and bit-parallelism

This page was built for publication: Tuning string matching for huge pattern sets

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