Faster string matching based on hashing and bit-parallelism
type: Item
instance of: scholarly article
title: Faster string matching based on hashing and bit-parallelism
zbMATH Open document ID: 1405.68460
author: Abdulrakeeb M. Al-Ssulami
author: Hassan I. Mathkour
published in: Information Processing Letters
publication date: 2017-04-20T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6706368
zbMATH Keywords: string matching
zbMATH Keywords: \(q\)-gram hashing
zbMATH Keywords: online algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2017.03.005
OpenAlex ID: W2605372187
cites work: The exact online string matching problem: a review of the most recent results
cites work: A fast string searching algorithm
cites work: A simple fast hybrid pattern-matching algorithm
cites work: Fast Pattern Matching in Strings
cites work: Improved and self-tuned occurrence heuristics
cites work: Q4496245
cites work: Q2723966
cites work: EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata
cites work: String Processing and Information Retrieval
cites work: Tuning BNDM withq-Grams
cites work: String matching with lookahead
cites work: Fast exact string matching algorithms
DOI: 10.1016/J.IPL.2017.03.005
description: scientific article; zbMATH DE number 6706368