Boosting pattern matching performance via k-bit filtering

DOI10.1007/978-90-481-9794-1_6zbMATH Open1286.68529OpenAlexW2275591851MaRDI QIDQ4932641FDOQ4932641

Authors: M. Oğuzhan Külekci, Bojian Xu, Jeffrey Scott Vitter 

Publication date: 6 October 2010

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-90-481-9794-1_6

Recommendations

• Exact pattern matching with feed-forward Bloom filters
• A comparison of BWT approaches to string pattern matching
• Accelerating Boyer-Moore searches on binary texts
• Exact pattern matching with feed-forward Bloom filters
• Accelerating Boyer Moore Searches on Binary Texts

zbMATH Keywords

pattern matching algorithmssearching process

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)

Cites Work

• A Mathematical Theory of Communication
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Jewels of Stringology
• A fast string searching algorithm
• Title not available (Why is that?)
• Efficient variants of the backward-oracle-matching algorithm
• Fast exact string matching algorithms
• Title not available (Why is that?)
• Accelerating Boyer Moore Searches on Binary Texts
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Fast Matching Method for DNA Sequences

This page was built for publication: Boosting pattern matching performance via \(k\)-bit filtering

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