On the public citation graph
String matching with constraints
0 signed · 55 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.1007/978-1-4613-1007-5_6openalex-snapshot
Pattern Matching in Strings
inferredcites →https://doi.org/10.1007/bf01084395openalex-snapshot
Detection of periodicities and string-matching in real time
inferredcites →https://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferredcites →https://doi.org/10.1016/0012-365x(79)90146-8openalex-snapshot
Une caracterisation des mots periodiques
inferredcites →https://doi.org/10.1016/0020-0190(80)90149-0openalex-snapshot
Lexicographically least circular substrings
inferredcites →https://doi.org/10.1016/0022-0000(83)90002-8openalex-snapshot
Time-space-optimal string matching
inferredcites →https://doi.org/10.1016/0196-6774(81)90013-4openalex-snapshot
Fast canonization of circular strings
inferredcites →https://doi.org/10.1016/0196-6774(83)90017-2openalex-snapshot
Factorizing words over an ordered alphabet
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/0304-3975(83)90109-3openalex-snapshot
Optimal off-line detection of repetitions in a string
inferredcites →https://doi.org/10.1016/0304-3975(85)90157-4openalex-snapshot
The smallest automation recognizing the subwords of a text
inferredcites →https://doi.org/10.1016/0304-3975(86)90041-1openalex-snapshot
Transducers and repetitions
inferredcites →https://doi.org/10.1109/sfcs.1977.3openalex-snapshot
A new proof of the linearity of the Boyer-Moore string searching algorithm
inferredcites →https://doi.org/10.1109/sfcs.1985.22openalex-snapshot
Efficient string matching in the presence of errors
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0206048openalex-snapshot
On the Worst-Case Behavior of String-Searching Algorithms
inferredcites →https://doi.org/10.1137/0209037openalex-snapshot
A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/359146.359148openalex-snapshot
On improving the worst case running time of the Boyer-Moore string matching algorithm
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.1145/800152.804905openalex-snapshot
Rapid identification of repeated patterns in strings, trees and arrays
inferredcites →https://doi.org/10.2140/pjm.1979.85.261openalex-snapshot
Avoidable patterns in strings of symbols
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199612)26:12<1439::aid-spe71>3.0.co;2-1openalex-snapshot
A Comparison of Approximate String Matching Algorithms
inferred← citeshttps://doi.org/10.1007/11753728_15openalex-snapshot
Window Subsequence Problems for Compressed Texts
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_18openalex-snapshot
On Minimizing Pattern Splitting in Multi-track String Matching
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_67openalex-snapshot
Two algorithms for approxmate string matching in static texts
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_46openalex-snapshot
Matching a set of strings with variable length don't cares
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_22openalex-snapshot
Approximate string-matching and the q-gram distance
inferred← citeshttps://doi.org/10.1007/978-3-319-46049-9_11openalex-snapshot
AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_32openalex-snapshot
On-Line Construction of Position Heaps
inferred← citeshttps://doi.org/10.1007/978-3-642-34188-5_23openalex-snapshot
On-Line Detection and Prediction of Temporal Patterns
inferred← citeshttps://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferred← citeshttps://doi.org/10.1007/bf01769703openalex-snapshot
Approximate string matching with suffix automata
inferred← citeshttps://doi.org/10.1007/bf02999876openalex-snapshot
Automates et algorithmes sur les mots
inferred← citeshttps://doi.org/10.1007/bfb0029808openalex-snapshot
Approximate string-matching over suffix trees
inferred← citeshttps://doi.org/10.1007/pl00009177openalex-snapshot
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00003-8openalex-snapshot
A comparison of imperative and purely functional suffix tree constructions
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90143-4openalex-snapshot
Approximate string-matching with q-grams and maximal matches
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.ipl.2006.02.008openalex-snapshot
Multiple serial episodes matching
inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.008openalex-snapshot
On minimizing pattern splitting in multi-track string matching
inferred← citeshttps://doi.org/10.1016/j.jda.2012.08.002openalex-snapshot
On-line construction of position heaps
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.016openalex-snapshot
Efficient dynamic dictionary matching with DAWGs and AC-automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)88195-9openalex-snapshot
Matching a set of strings with variable length don't cares
inferred← citeshttps://doi.org/10.1093/comjnl/44.5.425openalex-snapshot
Compact Morphic Directed Acyclic Word Graphs
inferred← citeshttps://doi.org/10.1145/303976.304008openalex-snapshot
Window-accumulated subsequence matching problem is linear
inferred← citeshttps://doi.org/10.3182/20070613-3-fr-4909.00012openalex-snapshot
DISCOVERY OF INTERMINGLED EVENT PATTERNS IN DISCRETE MONITORING DATA
inferred← citeshttps://doi.org/10.48550/arxiv.1104.1601openalex-snapshot
On-line construction of position heaps
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0603050openalex-snapshot
Multiple serial episode matching
inferred← citeshttps://doi.org/10.7717/peerj-cs.53openalex-snapshot
Efficient online detection of temporal patterns
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.