Faster string matching based on hashing and bit-parallelism (Q522976): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2017.03.005 / rank | |||
Property / author | |||
Property / author: Hassan I. Mathkour / rank | |||
Property / author | |||
Property / author: Hassan I. Mathkour / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W32 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6706368 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
string matching | |||
Property / zbMATH Keywords: string matching / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(q\)-gram hashing | |||
Property / zbMATH Keywords: \(q\)-gram hashing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
online algorithms | |||
Property / zbMATH Keywords: online algorithms / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2017.03.005 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2605372187 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The exact online string matching problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast string searching algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple fast hybrid pattern-matching algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved and self-tuned occurrence heuristics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4496245 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2723966 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: String Processing and Information Retrieval / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tuning BNDM with<i>q</i>-Grams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: String matching with lookahead / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast exact string matching algorithms / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2017.03.005 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:21, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Faster string matching based on hashing and bit-parallelism |
scientific article |
Statements
Faster string matching based on hashing and bit-parallelism (English)
0 references
20 April 2017
0 references
string matching
0 references
\(q\)-gram hashing
0 references
online algorithms
0 references