Bouma2 -- a high-performance input-aware multiple string-match algorithm

DOI10.1007/978-3-642-22256-6_6MaRDI QIDQ5200052zbMATH OpenOpenAlexFDO

Authors Erez Buchnik

Publication date 29 July 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22256-6_6

zbMATH Keywords

clique partitioningDpIfast pathhash functionsinteger linear programmingmotif findingpattern matchslow path

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• Parallel String Matching
• Tuning string matching for huge pattern sets
• Exact pattern matching with feed-forward Bloom filters
• Exact pattern matching with feed-forward Bloom filters
• Fast and flexible string matching by combining bit-parallelism and suffix automata

Cites work

• Efficient randomized pattern-matching algorithms
• Efficient string matching
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3633757 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)

Cited in

(2)

• Exact pattern matching with feed-forward Bloom filters
• Exact pattern matching with feed-forward Bloom filters

Describes a project that uses

Uses Software

• ClustalW

This page was built for publication: Bouma2 -- a high-performance input-aware multiple string-match algorithm

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