On the public citation graph
Approximate string matching with suffix automata
0 signed · 68 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/bf00292114openalex-snapshot
Time optimal left to right construction of position trees
inferredcites →https://doi.org/10.1007/bf01840446openalex-snapshot
AnO(ND) difference algorithm and its variations
inferredcites →https://doi.org/10.1016/0022-0000(88)90045-1openalex-snapshot
Fast string matching with k differences
inferredcites →https://doi.org/10.1016/0196-6774(80)90016-4openalex-snapshot
The theory and computation of evolutionary distances: Pattern recognition
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
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.1016/0885-064x(88)90008-8openalex-snapshot
Data structures and algorithms for approximate string matching
inferredcites →https://doi.org/10.1016/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
inferredcites →https://doi.org/10.1137/0219067openalex-snapshot
An Improved Algorithm For Approximate String Matching
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
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.1006/jagm.1997.0875openalex-snapshot
Dictionary Look-Up with One Error
inferred← citeshttps://doi.org/10.1006/jcom.1998.0497openalex-snapshot
Efficient Algorithms for Approximate String Matching with Swaps
inferred← citeshttps://doi.org/10.1007/11602569_8openalex-snapshot
Search-Optimized Suffix-Tree Storage for Biological Applications
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-45089-0_12openalex-snapshot
Ternary Directed Acyclic Word Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_7openalex-snapshot
A Dynamic Edit Distance Table
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_14openalex-snapshot
Theoretical and empirical comparisons of approximate string matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_43openalex-snapshot
Suffix cactus: A cross between suffix tree and suffix array
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_57openalex-snapshot
Dictionary look-up with small errors
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_47openalex-snapshot
Efficient algorithms for approximate string matching with swaps
inferred← citeshttps://doi.org/10.1007/3-540-63246-8_12openalex-snapshot
On compact directed acyclic word graphs
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-1-4615-2451-9_10openalex-snapshot
Algorithmic Advances for Searching Biosequence Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-59826-0_1openalex-snapshot
Algorithms for Indexing Highly Similar DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_15openalex-snapshot
Approximate String Matching with Reduced Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_30openalex-snapshot
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-20795-2_7openalex-snapshot
Ontology and Instance Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_16openalex-snapshot
Approximate Regular Expressions and Their Derivatives
inferred← citeshttps://doi.org/10.1007/bf01185431openalex-snapshot
Sublinear approximate string matching and biological applications
inferred← citeshttps://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferred← citeshttps://doi.org/10.1007/bf01942606openalex-snapshot
A Subquadratic Algorithm for Approximate Limited Expression Matching
inferred← citeshttps://doi.org/10.1007/bfb0029808openalex-snapshot
Approximate string-matching over suffix trees
inferred← citeshttps://doi.org/10.1007/bfb0030786openalex-snapshot
Constructing suffix arrays for multi-dimensional matrices
inferred← citeshttps://doi.org/10.1007/bfb0045093openalex-snapshot
Fast algorithms for aligning sequences with restricted affine gap penalties
inferred← citeshttps://doi.org/10.1007/s00224-011-9322-yopenalex-snapshot
Faster Approximate String Matching for Short Patterns
inferred← citeshttps://doi.org/10.1007/s10791-022-09416-9openalex-snapshot
Applying burst-tries for error-tolerant prefix search
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00083-xopenalex-snapshot
Fast and practical approximate string matching
inferred← citeshttps://doi.org/10.1016/0167-8655(94)00084-gopenalex-snapshot
String matching with left-to-right networks
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/j.dam.2004.04.012openalex-snapshot
On-line construction of compact directed acyclic word graphs
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.tcs.2004.07.008openalex-snapshot
Ternary directed acyclic word graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.007openalex-snapshot
Special factors and the combinatorics of suffix and factor automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.012openalex-snapshot
Extending alignments with k -mismatches and ℓ -gaps
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00828-9openalex-snapshot
Generalizations of suffix arrays to multi-dimensional matrices
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00861-7openalex-snapshot
Generalizations of suffix arrays to multi-dimensional matrices
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00082-0openalex-snapshot
A dynamic edit distance table
inferred← citeshttps://doi.org/10.1021/ci950222uopenalex-snapshot
Error Detection, Recovery, and Repair in the Translation of Inorganic Nomenclatures. 2. A Proposed Strategy
inferred← citeshttps://doi.org/10.1080/00207160212111openalex-snapshot
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
inferred← citeshttps://doi.org/10.1093/bioinformatics/btt004openalex-snapshot
Decombinator: a tool for fast, efficient gene assignment in T-cell receptor sequences using a finite state machine
inferred← citeshttps://doi.org/10.1093/comjnl/44.5.425openalex-snapshot
Compact Morphic Directed Acyclic Word Graphs
inferred← citeshttps://doi.org/10.1109/69.971194openalex-snapshot
Time-space trade-off analysis of morphic trie images
inferred← citeshttps://doi.org/10.1109/bibmw.2012.6470220openalex-snapshot
On the repetitive collection indexing problem
inferred← citeshttps://doi.org/10.1109/fscs.1990.89530openalex-snapshot
Approximate string matching in sublinear expected time
inferred← citeshttps://doi.org/10.1109/ideas.2002.1029677openalex-snapshot
Fast filter-and-refine algorithms for subsequence selection
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.106openalex-snapshot
Generalised Implementation for Fixed-Length Approximate String Matching under Hamming Distance and Applications
inferred← citeshttps://doi.org/10.1145/2381716.2381798openalex-snapshot
Overlapping repetitions in weighted sequence
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferred← citeshttps://doi.org/10.1145/3774934.3786421openalex-snapshot
Faster and Cheaper: Pushing the Sequence Alignment Throughput with Commercial CPUs
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.3233/jifs-223021openalex-snapshot
Statistical analysis of lexemes generated in ‘C’ programming using fuzzy automation
inferred← citeshttps://doi.org/10.46298/dmtcs.598openalex-snapshot
Derivatives of approximate regular expressions
inferred← citeshttps://doi.org/10.5958/0975-8089.2014.00018.9openalex-snapshot
Statistical Keyword Matching using Automata
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.