Boosting Pattern Matching Performance via k-bit Filtering
From MaRDI portal
Publication:4932641
DOI10.1007/978-90-481-9794-1_6zbMath1286.68529MaRDI QIDQ4932641
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
92D20: Protein sequences, DNA sequences
68U15: Computing methodologies for text processing; mathematical typography
68W32: Algorithms on strings
Cites Work
- A Mathematical Theory of Communication
- Fast exact string matching algorithms
- A fast string searching algorithm
- 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
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
- Jewels of Stringology
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Unnamed Item
- Unnamed Item