On the public citation graph
A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
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.7292openalex-snapshot
A survey on improving pattern matching algorithms for biological sequences
inferred← citeshttps://doi.org/10.1002/spe.4380221006openalex-snapshot
Tuning the boyer‐moore‐horspool string searching algorithm
inferred← citeshttps://doi.org/10.1002/spe.4380250703openalex-snapshot
Experimental results on string matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_34openalex-snapshot
On the Complexity of Determining the Period of a String
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_72openalex-snapshot
Constant-space string-matching
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_9openalex-snapshot
String searching algorithms revisited
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_102openalex-snapshot
Fast algorithms for two dimensional and multiple pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_215openalex-snapshot
Speeding up two string-matching algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_3openalex-snapshot
Constant-Space String-Matching
inferred← citeshttps://doi.org/10.1007/978-1-4613-1007-5_6openalex-snapshot
Pattern Matching in Strings
inferred← citeshttps://doi.org/10.1007/bf01185427openalex-snapshot
Speeding up two string-matching algorithms
inferred← citeshttps://doi.org/10.1007/bf03037101openalex-snapshot
A run-time efficient realization of Aho-Corasick pattern matching machines
inferred← citeshttps://doi.org/10.1007/s10703-005-2243-0openalex-snapshot
A Complete Mechanization of Correctness of a String-Preprocessing Algorithm
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00280-4openalex-snapshot
Experimenting with pattern-matching algorithms
inferred← citeshttps://doi.org/10.1016/0167-6423(96)00008-1openalex-snapshot
A taxonomy of sublinear multiple keyword pattern matching algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90139-7openalex-snapshot
A variation on the Boyer-Moore algorithm
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferred← citeshttps://doi.org/10.1016/j.compbiomed.2003.11.003openalex-snapshot
On exact string matching of unique oligonucleotides
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00107-5openalex-snapshot
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00421-7openalex-snapshot
Correctness of substring-preprocessing in Boyer–Moore's pattern matching algorithm
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00005-4openalex-snapshot
A unifying look at the Apostolico–Giancarlo string-matching algorithm
inferred← citeshttps://doi.org/10.1017/cbo9781316135228openalex-snapshot
Flexible Pattern Matching in Strings
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.003openalex-snapshot
Multiple string matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.004openalex-snapshot
Extended string matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.005openalex-snapshot
Regular expression matching
inferred← citeshttps://doi.org/10.1049/ip-sen:20041265openalex-snapshot
Taxonomy-based software construction of SPARE Time: a case study
inferred← citeshttps://doi.org/10.1080/00207160214653openalex-snapshot
A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
inferred← citeshttps://doi.org/10.1109/access.2021.3057398openalex-snapshot
Study of Isabelle/HOL on Formal Algorithm Analysis and Code Generation
inferred← citeshttps://doi.org/10.1109/iceccs.2002.1181499openalex-snapshot
Mechanization of a proof of string-preprocessing in Boyer-Moore's pattern matching algorithm
inferred← citeshttps://doi.org/10.1109/ssst.2003.1194532openalex-snapshot
Longest repeated suffix problem on the arrays with pipelined optical bus systems
inferred← citeshttps://doi.org/10.1137/0215007openalex-snapshot
The Boyer–Moore–Galil String Searching Strategies Revisited
inferred← citeshttps://doi.org/10.1137/s0097539791195543openalex-snapshot
Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm
inferred← citeshttps://doi.org/10.11606/d.55.2019.tde-31102019-181538openalex-snapshot
ALGORITMOS DE BUSCA EM TEXTO
inferred← citeshttps://doi.org/10.18489/sacj.v53i0.199openalex-snapshot
Weak factor automata: the failure of failure factor oracles?
inferred← citeshttps://doi.org/10.4156/jdcta.vol3.issue4.1openalex-snapshot
On the shift-table in Boyer-Moore’s String Matching Algorithm
inferred← citeshttps://doi.org/10.47749/t/unicamp.1993.65322openalex-snapshot
Metodos eficientes para reconhecimento de padrões em texto
inferred← citeshttps://doi.org/10.5555/313651.313816openalex-snapshot
Parameterized pattern matching by Boyer-Moore-type algorithms
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.