On the public citation graph

A linear time pattern matching algorithm between a string and a tree

https://doi.org/10.1007/bfb0029792
0 signed · 36 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.1007/bf01762122openalex-snapshot
Parallel construction of a suffix tree with applications
inferredcites →https://doi.org/10.1016/0196-6774(87)90030-7openalex-snapshot
O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
inferredcites →https://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferredcites →https://doi.org/10.1021/c160016a007openalex-snapshot
A Graph-Theoretic Algorithm for Matching Chemical Structures.
inferredcites →https://doi.org/10.1021/ci00047a025openalex-snapshot
Chemical substructure searching
inferredcites →https://doi.org/10.1109/fscs.1990.89533openalex-snapshot
Faster tree pattern matching
inferredcites →https://doi.org/10.1109/sfcs.1989.63475openalex-snapshot
Efficient tree pattern matching
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1137/0206053openalex-snapshot
An Analysis of a Good Algorithm for the Subtree Problem
inferredcites →https://doi.org/10.1145/129712.129719openalex-snapshot
Alphabet independent two dimensional matching
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
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.1006/jagm.1999.1063openalex-snapshot
Pattern Matching in Hypertext
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_56openalex-snapshot
Pattern matching in hypertext
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_17openalex-snapshot
Complexity Issues of String to Graph Approximate Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-36805-9_11openalex-snapshot
Heuristics for the de Bruijn Graph Sequence Mapping Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_18openalex-snapshot
Fast Pattern Matching with Epsilon Transitions
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_1openalex-snapshot
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_21openalex-snapshot
A Succinct Index for Hypertext
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_15openalex-snapshot
Hypertext Searching - A Survey
inferred← citeshttps://doi.org/10.1007/bfb0054335openalex-snapshot
Improved approximate pattern matching on hypertext
inferred← citeshttps://doi.org/10.1007/s00224-024-10194-8openalex-snapshot
Elastic-Degenerate String Matching with 1 Error or Mismatch
inferred← citeshttps://doi.org/10.1007/s00453-022-00989-xopenalex-snapshot
Solving String Problems on Graphs Using the Labeled Direct Product
inferred← citeshttps://doi.org/10.1016/b978-0-323-95502-7.00021-xopenalex-snapshot
Graph Isomorphism
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104748openalex-snapshot
On the complexity of approximately matching a string to a directed graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.04.012openalex-snapshot
Parameterized matching on non-linear structures
inferred← citeshttps://doi.org/10.1016/j.jda.2012.10.001openalex-snapshot
Indexing hypertext
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00333-3openalex-snapshot
Improved approximate pattern matching on hypertext
inferred← citeshttps://doi.org/10.1063/5.0258692openalex-snapshot
Comparing the accuracy of pattern matching and with token based authentication for secure cloud computing
inferred← citeshttps://doi.org/10.1093/bioadv/vbad167openalex-snapshot
PanPA : generation and alignment of panproteome graphs
inferred← citeshttps://doi.org/10.1101/001669openalex-snapshot
Algorithms in Stringomics (I): Pattern-Matching against “Stringomes”
inferred← citeshttps://doi.org/10.1109/icoin.2001.905436openalex-snapshot
Graphical techniques in intrusion detection systems
inferred← citeshttps://doi.org/10.1137/1.9781611976496.26openalex-snapshot
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
inferred← citeshttps://doi.org/10.1145/3588334openalex-snapshot
On the Complexity of String Matching for Graphs
inferred← citeshttps://doi.org/10.1186/s12859-018-2436-3openalex-snapshot
ASGAL: aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events
inferred← citeshttps://doi.org/10.4018/979-8-3693-5563-3.ch018openalex-snapshot
Comparing the Accuracy of Pattern Matching With Digital Signature for Secure Cloud Computing
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.