String matching with lookahead
type: Item
instance of: scholarly article
title: String matching with lookahead
zbMATH Open document ID: 1329.68316
author: Hannu Peltola
author: Jorma Tarhio
published in: Discrete Applied Mathematics
publication date: 2015-09-22T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6484135
zbMATH Keywords: string matching
zbMATH Keywords: bit-parallelism
zbMATH Keywords: BNDM
zbMATH Keywords: 2-byte read
zbMATH Keywords: \(q\)-grams
MaRDI profile type: Publication
full work available at URL: j.dam.2013.10.034
OpenAlex ID: W2050498978
cites work: A fast string searching algorithm
cites work: Improving practical exact string matching
cites work: EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
cites work: Shift-or string matching with super-alphabets
cites work: Fast exact string matching algorithms
cites work: NR-grep: A fast and flexible pattern-matching tool
cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata
cites work: String Processing and Information Retrieval
cites work: Q3782834
DOI: 10.1016/J.DAM.2013.10.034
Recommended article: Q4036609
Recommended article: String Matching with Involutions
Recommended article: Q4206395
Recommended article: Q3809299
Recommended article: String Matching for the Novice
Recommended article: Q3468609
Recommended article: On string matching with mismatches
Recommended article: String matching with variable length gaps
Recommended article: Two-way string-matching
description: scientific article; zbMATH DE number 6484135