On the public citation graph

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition

https://doi.org/10.1145/3301295
0 signed · 30 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/spe.4380211105openalex-snapshot
Fast string searching
inferredcites →https://doi.org/10.1007/3-540-47849-3_18openalex-snapshot
Factor Oracle: A New Structure for Pattern Matching
inferredcites →https://doi.org/10.1007/978-3-319-38827-4_12openalex-snapshot
Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences
inferredcites →https://doi.org/10.1007/978-3-642-13193-6_12openalex-snapshot
Bit-Parallel Search Algorithms for Long Patterns
inferredcites →https://doi.org/10.1007/978-3-642-30850-5_16openalex-snapshot
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-31606-7_13openalex-snapshot
A Fast Suffix Automata Based Algorithm for Exact Online String Matching
inferredcites →https://doi.org/10.1007/bf01185427openalex-snapshot
Speeding up two string-matching algorithms
inferredcites →https://doi.org/10.1007/bfb0030778openalex-snapshot
A bit-parallel approach to suffix automata: Fast extended string matching
inferredcites →https://doi.org/10.1016/j.ic.2011.03.006openalex-snapshot
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
inferredcites →https://doi.org/10.1016/j.ipl.2007.01.002openalex-snapshot
Fast exact string matching algorithms
inferredcites →https://doi.org/10.1016/j.jda.2014.07.003openalex-snapshot
Fast and flexible packed string matching
inferredcites →https://doi.org/10.1016/j.jda.2014.07.006openalex-snapshot
Improved and self-tuned occurrence heuristics
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1137/0208029openalex-snapshot
The Complexity of Pattern Matching for a Random String
inferredcites →https://doi.org/10.1142/s0129054109006991openalex-snapshot
EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
inferredcites →https://doi.org/10.1145/135239.135243openalex-snapshot
A new approach to text searching
inferredcites →https://doi.org/10.1145/2431211.2431212openalex-snapshot
The exact online string matching problem
inferredcites →https://doi.org/10.25596/jalc-2005-589openalex-snapshot
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm
inferredcites →https://doi.org/10.48550/arxiv.1707.00469openalex-snapshot
Speeding Up String Matching by Weak Factor Recognition

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-79121-6_14openalex-snapshot
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton
inferred← citeshttps://doi.org/10.1007/978-3-030-85088-3_8openalex-snapshot
The Range Automaton: An Efficient Approach to Text-Searching
inferred← citeshttps://doi.org/10.1007/978-981-16-6460-1_21openalex-snapshot
An Efficient Hashing Method for Exact String Matching Problems
inferred← citeshttps://doi.org/10.1007/s11227-022-04673-3openalex-snapshot
A new fast technique for pattern matching in biological sequences
inferred← citeshttps://doi.org/10.1016/j.ipm.2022.103057openalex-snapshot
LsHASHq: A string matching algorithm exploiting longer q -gram shifting
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.08.028openalex-snapshot
A weak approach to suffix automata simulation for exact and approximate string matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.005openalex-snapshot
Compact suffix automata representations for searching long patterns
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.034openalex-snapshot
Improved characters distance sampling for online and offline text searching
inferred← citeshttps://doi.org/10.1109/access.2020.2969038openalex-snapshot
Simple and Efficient Pattern Matching Algorithms for Biological Sequences
inferred← citeshttps://doi.org/10.1109/csicc49403.2020.9050070openalex-snapshot
Efficient Pattern Matching Algorithms for DNA Sequences
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.