On the public citation graph

A very fast string matching algorithm for small alphabets and long patterns

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-024x(19980425)28:5<561::aid-spe170>3.0.co;2-wopenalex-snapshot

Experiments on string matching in memory structures

inferredcites →https://doi.org/10.1002/spe.4380211105openalex-snapshot

Fast string searching

inferredcites →https://doi.org/10.1002/spe.4380221006openalex-snapshot

Tuning the boyer‐moore‐horspool string searching algorithm

inferredcites →https://doi.org/10.1007/bf01185427openalex-snapshot

Speeding up two string-matching algorithms

inferredcites →https://doi.org/10.1016/0304-3975(92)90139-7openalex-snapshot

A variation on the Boyer-Moore algorithm

inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot

Linear pattern matching algorithms

inferredcites →https://doi.org/10.1137/0206024openalex-snapshot

Fast Pattern Matching in Strings

inferredcites →https://doi.org/10.1142/2418openalex-snapshot

String Searching Algorithms

inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot

A fast string searching algorithm

inferredcites →https://doi.org/10.5860/choice.32-5696openalex-snapshot

Text algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.6505openalex-snapshot

q‐frame hash comparison based exact string matching algorithms for DNA sequences

inferred← citeshttps://doi.org/10.1002/spe.2433openalex-snapshot

Engineering order‐preserving pattern matching with SIMD parallelism

inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_9openalex-snapshot

Fast Cartesian Tree Matching

inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_10openalex-snapshot

Fast Multiple Pattern Cartesian Tree Matching

inferred← citeshttps://doi.org/10.1007/978-3-030-53187-4_53openalex-snapshot

Novel Alignment Approach of DNA Sequences

inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_6openalex-snapshot

A Very Fast String Matching Algorithm Based on Condensed Alphabets

inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_25openalex-snapshot

Fast Matching Method for DNA Sequences

inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_10openalex-snapshot

An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings

inferred← citeshttps://doi.org/10.1007/s11227-025-07165-2openalex-snapshot

Boosting exact pattern matching with extreme gradient boosting (and more)

inferred← citeshttps://doi.org/10.1007/s11390-016-1618-6openalex-snapshot

AS-Index: A Structure for String Search Using n-Grams and Algebraic Signatures

inferred← citeshttps://doi.org/10.1007/s40745-016-0086-8openalex-snapshot

N-Folded Parallel String Matching Mechanism

inferred← citeshttps://doi.org/10.1007/s41870-019-00371-1openalex-snapshot

BFM: a forward backward string matching algorithm with improved shifting for information retrieval

inferred← citeshttps://doi.org/10.1016/j.comcom.2004.06.005openalex-snapshot

A fast string search algorithm for deep packet classification

inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.023openalex-snapshot

The order-preserving pattern matching problem in practice

inferred← citeshttps://doi.org/10.1016/j.eswa.2017.03.026openalex-snapshot

EPMA: Efficient pattern matching algorithm for DNA sequences

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.002openalex-snapshot

The wide window string matching algorithm

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.009openalex-snapshot

Fast algorithms for single and multiple pattern Cartesian tree matching

inferred← citeshttps://doi.org/10.1088/1757-899x/183/1/012029openalex-snapshot

Keyword Extraction from Multiple Words for Report Recommendations in Media Wiki

inferred← citeshttps://doi.org/10.1093/comjnl/bxag075openalex-snapshot

Monotonic run length text sampling and fake sampled positions

inferred← citeshttps://doi.org/10.1093/comjnl/bxw023openalex-snapshot

A Transformation For Optimizing String-Matching Algorithms For Long Patterns

inferred← citeshttps://doi.org/10.1109/access.2020.2984503openalex-snapshot

A Novel Web Scraping Approach Using the Additional Information Obtained From Web Pages

inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493509openalex-snapshot

A multipattern matching algorithm using sampling and bit index

inferred← citeshttps://doi.org/10.1109/aina.2005.184openalex-snapshot

Fast Pattern Detection in Stream Data

inferred← citeshttps://doi.org/10.1109/icbbe.2007.84openalex-snapshot

gWord: A Tool for Genome-Wide Word Search and Count

inferred← citeshttps://doi.org/10.1109/iccse.2009.5228461openalex-snapshot

A jumping string mode matching algorithm

inferred← citeshttps://doi.org/10.1109/icisa.2011.5772430openalex-snapshot

Software Based Implementation Methodologies for Deep Packet Inspection

inferred← citeshttps://doi.org/10.1109/tkde.2025.3649808openalex-snapshot

Order-Preserving Pattern Matching: Review

inferred← citeshttps://doi.org/10.1145/1645953.1645993openalex-snapshot

AS-index

inferred← citeshttps://doi.org/10.1145/2905055.2905108openalex-snapshot

A Novel Multi Pattern String Matching Algorithm with While Shift

inferred← citeshttps://doi.org/10.13140/rg.2.1.5184.9046openalex-snapshot

A FAST HEURISTIC FOR EXACT STRING MATCHING

inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0110438openalex-snapshot

An Efficient and Rapid Method for Detection of Mutations in Deoxyribonucleic Acid - Sequences

inferred← citeshttps://doi.org/10.3390/math10121954openalex-snapshot

An Improved Order-Preserving Pattern Matching Algorithm Using Fingerprints

inferred← citeshttps://doi.org/10.48550/arxiv.0810.2390openalex-snapshot

Efficient Pattern Matching on Binary Strings

inferred← citeshttps://doi.org/10.48550/arxiv.1012.2547openalex-snapshot

The Exact String Matching Problem: a Comprehensive Experimental Evaluation

inferred← citeshttps://doi.org/10.48550/arxiv.1509.09228openalex-snapshot

Fast Algorithms for Exact String Matching

inferred← citeshttps://doi.org/10.5120/ijca2016909441openalex-snapshot

Study of Selected Shifting based String Matching Algorithms

inferred← citeshttps://doi.org/10.5120/ijca2016910474openalex-snapshot

Applying Bi-Directional Search Strategy in Selected String Matching Algorithms

inferred← citeshttps://doi.org/10.70675/af74963cz889bz4d1dz93ccz7c718c6c7b54openalex-snapshot

Traitement de la polyphonie pour l'analyse informatique de partitions musicales

inferred← citeshttps://doi.org/10.7763/ijcte.2012.v4.462openalex-snapshot

Quick-Skip Search Hybrid Algorithm for the Exact String Matching Problem

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.