On the public citation graph

Jewels of Stringology

https://doi.org/10.1142/4838
0 signed · 139 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/11605157_21openalex-snapshot
The Structure of Subword Graphs and Suffix Trees of Fibonacci Words
inferred← citeshttps://doi.org/10.1007/11672142_14openalex-snapshot
The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_12openalex-snapshot
Ternary Directed Acyclic Word Graphs
inferred← citeshttps://doi.org/10.1007/978-1-84800-070-4_12openalex-snapshot
Data Structures
inferred← citeshttps://doi.org/10.1007/978-1-84800-070-4_18openalex-snapshot
Set and String Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8_12openalex-snapshot
Truncated DAWGs and Their Application to Minimal Absent Word Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8_19openalex-snapshot
Faster Recovery of Approximate Periods over Edit Distance
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_13openalex-snapshot
Online Algorithms on Antipowers and Antiperiods
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_11openalex-snapshot
Generalized Dictionary Matching Under Substring Consistent Equivalence Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_44openalex-snapshot
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_13openalex-snapshot
Finding the Cyclic Covers of a String
inferred← citeshttps://doi.org/10.1007/978-3-032-02138-0_7openalex-snapshot
LLMs for Software Architecture Knowledge: A Comparative Analysis Among Seven LLMs
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_18openalex-snapshot
Shortest Unique Substring Query Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_20openalex-snapshot
Efficient Algorithms for Shortest Partial Seeds in Words
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_18openalex-snapshot
A Full and Linear Index of a Tree for Tree Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_16openalex-snapshot
Timed Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_47openalex-snapshot
Backward Linearised Tree Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_32openalex-snapshot
Universal Reconstruction of a String
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_5openalex-snapshot
Unbordered Pictures: Properties and Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-23826-5_22openalex-snapshot
Space-Efficient Detection of Unusual Words
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-319-60252-3_2openalex-snapshot
Avoiding Overlaps in Pictures
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_22openalex-snapshot
Detecting One-Variable Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_26openalex-snapshot
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-72550-5_41openalex-snapshot
Reducing Computational Effort for Plagiarism Detection with Approximate String Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_5openalex-snapshot
Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_3openalex-snapshot
Automaton-Based Sublinear Keyword Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_40openalex-snapshot
Indexing Factors with Gaps
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_17openalex-snapshot
Engineering a Compressed Suffix Tree Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_22openalex-snapshot
Space-Efficient Algorithms for Document Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_30openalex-snapshot
Tiling Periodicity
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_35openalex-snapshot
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_57openalex-snapshot
Finding Patterns in Given Intervals
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_60openalex-snapshot
Structural Analysis of Gapped Motifs of a String
inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_17openalex-snapshot
Factor Automata of Automata and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_5openalex-snapshot
Indexing Circular Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_14openalex-snapshot
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
inferred← citeshttps://doi.org/10.1007/978-3-642-04205-8_17openalex-snapshot
A Two-Tire Index Structure for Approximate String Matching with Block Moves
inferred← citeshttps://doi.org/10.1007/978-3-642-04735-0_15openalex-snapshot
A Survey of Text Processing Tools for the Automatic Analysis of Molecular Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_18openalex-snapshot
LPF Computation Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_6openalex-snapshot
A Taxonomy of Some Right-to-Left String-Matching Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_8openalex-snapshot
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_16openalex-snapshot
Simple Real-Time Constant-Space String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_22openalex-snapshot
Sparse and Truncated Suffix Trees on Variable-Length Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-21969-6_3openalex-snapshot
Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
inferred← citeshttps://doi.org/10.1007/978-3-642-25483-3_21openalex-snapshot
Partial Plagiarism Detection Using String Matching with Mismatches
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_30openalex-snapshot
Efficient Data Structures for the Factor Periodicity Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_24openalex-snapshot
Efficient Counting of Square Substrings in a Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_25openalex-snapshot
Permuted Pattern Matching on Multi-track Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_18openalex-snapshot
Fast Algorithm for Partial Covers in Words
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_8openalex-snapshot
Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_24openalex-snapshot
Pal k is Linear Recognizable Online
inferred← citeshttps://doi.org/10.1007/978-90-481-9794-1_6openalex-snapshot
Boosting Pattern Matching Performance via k-bit Filtering
inferred← citeshttps://doi.org/10.1007/978-981-13-0023-3_10openalex-snapshot
A Filtering Technique for All Pairs Approximate Parameterized String Matching
inferred← citeshttps://doi.org/10.1007/978-981-16-4095-7_7openalex-snapshot
Compression and Pattern Matching
inferred← citeshttps://doi.org/10.1007/s00224-008-9131-0openalex-snapshot
Bijective Linear Time Coding and Decoding for k-Trees
inferred← citeshttps://doi.org/10.1007/s00224-013-9522-8openalex-snapshot
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
inferred← citeshttps://doi.org/10.1007/s00224-025-10257-4openalex-snapshot
The ceBWT Index: An Index for Circular Cartesian Tree Matching on Multiple Texts
inferred← citeshttps://doi.org/10.1007/s00236-016-0258-1openalex-snapshot
Disjunctivity and other properties of sets of pseudo-bordered words
inferred← citeshttps://doi.org/10.1007/s00285-007-0109-3openalex-snapshot
Multiple pattern matching: a Markov chain approach
inferred← citeshttps://doi.org/10.1007/s00453-007-9141-3openalex-snapshot
Indexing Factors with Gaps
inferred← citeshttps://doi.org/10.1007/s00453-014-9873-9openalex-snapshot
Improved Space-Time Tradeoffs for Approximate Full-Text Indexing with One Edit Error
inferred← citeshttps://doi.org/10.1007/s00453-014-9915-3openalex-snapshot
Fast Algorithm for Partial Covers in Words
inferred← citeshttps://doi.org/10.1007/s00453-021-00842-7openalex-snapshot
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
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.1007/s00453-022-01092-xopenalex-snapshot
Near-Optimal Quantum Algorithms for String Problems
inferred← citeshttps://doi.org/10.1007/s10559-010-9268-0openalex-snapshot
On trace inclusion optimization problems
inferred← citeshttps://doi.org/10.1007/s10559-013-9515-2openalex-snapshot
Forbidden traces and forbidden subtraces
inferred← citeshttps://doi.org/10.1007/s10791-006-9021-5openalex-snapshot
Multilingual phrase-based concordance generation in real-time
inferred← citeshttps://doi.org/10.1007/s10878-006-9029-1openalex-snapshot
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
inferred← citeshttps://doi.org/10.1007/s10990-013-9093-zopenalex-snapshot
Functional programs as compressed data
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.025openalex-snapshot
Computing the number of cubic runs in standard Sturmian words
inferred← citeshttps://doi.org/10.1016/j.ic.2007.01.007openalex-snapshot
The number of runs in a string
inferred← citeshttps://doi.org/10.1016/j.scico.2010.04.012openalex-snapshot
A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
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.2005.03.030openalex-snapshot
Parsing with a finite dictionary
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.011openalex-snapshot
Relational codes of words
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.006openalex-snapshot
Order-preserving matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.015openalex-snapshot
Efficient counting of square substrings in a tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.004openalex-snapshot
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.009openalex-snapshot
Trees
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.012openalex-snapshot
Texts
inferred← citeshttps://doi.org/10.1021/acs.jpcb.8b07206openalex-snapshot
On the Natural Structure of Amino Acid Patterns in Families of Protein Sequences
inferred← citeshttps://doi.org/10.1038/s41598-019-38757-7openalex-snapshot
Genome wide analysis of W-box element in Arabidopsis thaliana reveals TGAC motif with genes down regulated by heat and salinity
inferred← citeshttps://doi.org/10.1038/srep23959openalex-snapshot
Protein Repeats from First Principles
inferred← citeshttps://doi.org/10.1051/ita:2008016openalex-snapshot
Compatibility relations on codes and free monoids
inferred← citeshttps://doi.org/10.1080/09298210903288329openalex-snapshot
A System for Identifying Common Melodic Phrases in the Masses of Palestrina
inferred← citeshttps://doi.org/10.1098/rspa.2015.0551openalex-snapshot
Maximum margin classifier working in a set of strings
inferred← citeshttps://doi.org/10.1109/dcc.2010.27openalex-snapshot
An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree
inferred← citeshttps://doi.org/10.1109/dcc.2016.61openalex-snapshot
A Space Efficient Direct Access Data Structure
inferred← citeshttps://doi.org/10.1109/dcc.2017.73openalex-snapshot
LZ-End Parsing in Compressed Space
inferred← citeshttps://doi.org/10.1109/icaicta.2017.8090990openalex-snapshot
Computing information quantity as similarity measure for music classification task
inferred← citeshttps://doi.org/10.1109/socialcom.2010.13openalex-snapshot
Learning About the Quality of Teamwork from Wikiteams
inferred← citeshttps://doi.org/10.1109/tc.2010.95openalex-snapshot
A Hybrid Algorithm of Backward Hashing and Automaton Tracking for Virus Scanning
inferred← citeshttps://doi.org/10.1109/tcbb.2005.5openalex-snapshot
Bases of Motifs for Generating Repeated Patterns with Wild Cards
inferred← citeshttps://doi.org/10.1109/tit.2022.3148190openalex-snapshot
Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel
inferred← citeshttps://doi.org/10.1109/tit.2022.3173185openalex-snapshot
Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions
inferred← citeshttps://doi.org/10.1109/tit.2022.3224382openalex-snapshot
Toward a Definitive Compressibility Measure for Repetitive Sequences
inferred← citeshttps://doi.org/10.1109/tit.2023.3237711openalex-snapshot
Reed Solomon Codes Against Adversarial Insertions and Deletions
inferred← citeshttps://doi.org/10.1109/tit.2025.3545061openalex-snapshot
Combinatorial Alphabet-Dependent Bounds for Insdel Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3622889openalex-snapshot
Anonymous Shamir’s Secret-Sharing via Reed–Solomon Codes Against Permutations, Insertions, and Deletions
inferred← citeshttps://doi.org/10.1109/tse.2007.70720openalex-snapshot
Finding Clones with Dup: Analysis of an Experiment
inferred← citeshttps://doi.org/10.1137/1.9781611973730.36openalex-snapshot
Internal Pattern Matching Queries in a Text and Applications
inferred← citeshttps://doi.org/10.1137/1.9781611977073.109openalex-snapshot
Near-Optimal Quantum Algorithms for String Problems
inferred← citeshttps://doi.org/10.1142/s0129054109007017openalex-snapshot
USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS
inferred← citeshttps://doi.org/10.1142/s0129054119400215openalex-snapshot
Sets of Pictures Avoiding Overlaps
inferred← citeshttps://doi.org/10.1145/1088348.1088359openalex-snapshot
Polymorphic string matching
inferred← citeshttps://doi.org/10.1145/1217856.1217858openalex-snapshot
Linear work suffix array construction
inferred← citeshttps://doi.org/10.1145/1412228.1455263openalex-snapshot
Succinct backward-DAWG-matching
inferred← citeshttps://doi.org/10.1145/1498698.1594228openalex-snapshot
Engineering a compressed suffix tree implementation
inferred← citeshttps://doi.org/10.1145/1832772.1832806openalex-snapshot
Learning about team collaboration from Wikipedia edit history
inferred← citeshttps://doi.org/10.1145/2034691.2034741openalex-snapshot
Citation pattern matching algorithms for citation-based plagiarism detection
inferred← citeshttps://doi.org/10.1145/2103746.2103770openalex-snapshot
Functional programs as compressed data
inferred← citeshttps://doi.org/10.1145/2229163.2229175openalex-snapshot
Counting occurrences for a finite set of words
inferred← citeshttps://doi.org/10.1145/2274576.2274595openalex-snapshot
On the complexity of query answering over incomplete XML documents
inferred← citeshttps://doi.org/10.1145/2513148openalex-snapshot
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
inferred← citeshttps://doi.org/10.1145/2513456.2513488openalex-snapshot
Efficient representation of DNA data for pattern recognition using failure factor oracles
inferred← citeshttps://doi.org/10.1145/2535933openalex-snapshot
Spaces, Trees, and Colors
inferred← citeshttps://doi.org/10.1145/2584249openalex-snapshot
PromotionRank
inferred← citeshttps://doi.org/10.1145/2594408openalex-snapshot
Locally Compressed Suffix Arrays
inferred← citeshttps://doi.org/10.1145/2635816openalex-snapshot
Alphabet-Independent Compressed Text Indexing
inferred← citeshttps://doi.org/10.1145/3386369openalex-snapshot
A Linear-Time Algorithm for Seeds Computation
inferred← citeshttps://doi.org/10.1145/3426473openalex-snapshot
Optimal-Time Dictionary-Compressed Indexes
inferred← citeshttps://doi.org/10.1145/3432999openalex-snapshot
Indexing Highly Repetitive String Collections, Part II
inferred← citeshttps://doi.org/10.1145/3701561openalex-snapshot
Computing MEMs and Relatives on Repetitive Text Collections
inferred← citeshttps://doi.org/10.1186/s13015-018-0122-7openalex-snapshot
A safe and complete algorithm for metagenomic assembly
inferred← citeshttps://doi.org/10.18489/sacj.v53i0.199openalex-snapshot
Weak factor automata: the failure of failure factor oracles?
inferred← citeshttps://doi.org/10.23638/dmtcs-19-4-4openalex-snapshot
Longest Gapped Repeats and Palindromes
inferred← citeshttps://doi.org/10.25596/jalc-2005-627openalex-snapshot
Constructing Factor Oracles
inferred← citeshttps://doi.org/10.3906/elk-1601-92openalex-snapshot
A new word-based compression model allowing compressed pattern matching
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.513-517.1017openalex-snapshot
Approximate Chinese String Matching Techniques Based on Pinyin Input Method
inferred← citeshttps://doi.org/10.4204/eptcs.151.18openalex-snapshot
Representations of Circular Words
inferred← citeshttps://doi.org/10.4204/eptcs.252.10openalex-snapshot
Constructing Words with High Distinct Square Densities
inferred← citeshttps://doi.org/10.46298/dmtcs.517openalex-snapshot
Tiling Periodicity
inferred← citeshttps://doi.org/10.48550/arxiv.0912.0807openalex-snapshot
Practical Algorithmic Techniques for Several String Processing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02321openalex-snapshot
Position Heaps for Parameterized Strings
inferred← citeshttps://doi.org/10.48550/arxiv.1902.00216openalex-snapshot
An Extension of Linear-size Suffix Tries for Parameterized Strings
inferred← citeshttps://doi.org/10.5626/jok.2019.46.12.1232openalex-snapshot
Parallel Computation of Order-Preserving Periods and Order-Preserving Borders of a Set of Strings
inferred← citeshttps://doi.org/10.70675/394d262cza014z447fzb6f9z0dcf7f11b56bopenalex-snapshot
Assertions and measurements for mixed-signal simulation
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.