On the public citation graph

Data Structures and Algorithms for the String Statistics Problem

https://doi.org/10.1007/bf01955046
0 signed · 54 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/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/bf01190846openalex-snapshot
Squares, cubes, and time-space efficient string searching
inferredcites →https://doi.org/10.1016/0022-0000(85)90060-1openalex-snapshot
Structural properties of the string statistics problem
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.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1307/mmj/1028998766openalex-snapshot
The equation $a^M=b^Nc^P$ in a free group.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11533719_2openalex-snapshot
Monotony and Surprise
inferred← citeshttps://doi.org/10.1007/11889342_51openalex-snapshot
Bridging Lossy and Lossless Compression by Motif Pattern Discovery
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_33openalex-snapshot
Finding Maximal Quasiperiodicities in Strings
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_62openalex-snapshot
Solving the String Statistics Problem in Time $$ \mathcal{O} $$ (nlogn)
inferred← citeshttps://doi.org/10.1007/3-540-45650-3_35openalex-snapshot
Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems
inferred← citeshttps://doi.org/10.1007/978-1-4020-6268-1_65openalex-snapshot
Algorithm for Solving the Collisions in Uniform Simple Hashing with Combined Linked Ordered Lists
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_6openalex-snapshot
String Pattern Matching for a Deluge Survival Kit
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_7openalex-snapshot
Shortest Covers of All Cyclic Shifts of a String
inferred← citeshttps://doi.org/10.1007/978-3-540-39984-1_11openalex-snapshot
Linear-Time Off-Line Text Compression by Longest-First Substitution
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_54openalex-snapshot
Range Non-overlapping Indexing and Successive List Indexing
inferred← citeshttps://doi.org/10.1007/978-3-540-88869-7_2openalex-snapshot
Monotony and Surprise
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_105openalex-snapshot
Range Non-overlapping Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_5openalex-snapshot
Cycle Detection and Correction
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_25openalex-snapshot
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_1openalex-snapshot
Approximate Period Detection and Correction
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_1openalex-snapshot
Forty Years of Text Indexing
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/bf01762122openalex-snapshot
Parallel construction of a suffix tree with applications
inferred← citeshttps://doi.org/10.1007/s00453-014-9915-3openalex-snapshot
Fast Algorithm for Partial Covers in Words
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90049-iopenalex-snapshot
Self-alignments in words and their applications
inferred← citeshttps://doi.org/10.1016/j.dam.2006.11.017openalex-snapshot
Periodicity and repetitions in parameterized strings
inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.029openalex-snapshot
Bridging Lossy and Lossless Compression by Motif Pattern Discovery
inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.030openalex-snapshot
Periodicity and Repetitions in Parameterized Strings
inferred← citeshttps://doi.org/10.1016/j.jda.2011.04.006openalex-snapshot
Searching for smallest grammars on large sequences and application to DNA
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.015openalex-snapshot
Improved algorithms for the range next value problem and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.026openalex-snapshot
Period recovery of strings over the Hamming and edit distances
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.033openalex-snapshot
Experimental evaluation of algorithms for computing quasiperiods
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.006openalex-snapshot
I/O-efficient data structures for non-overlapping indexing
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.011openalex-snapshot
Shortest covers of all cyclic shifts of a string
inferred← citeshttps://doi.org/10.1089/10665270050081397openalex-snapshot
Efficient Detection of Unusual Words
inferred← citeshttps://doi.org/10.1109/5.892709openalex-snapshot
Off-line compression by greedy textual substitution
inferred← citeshttps://doi.org/10.1109/6046.944475openalex-snapshot
Discovering nontrivial repeating patterns in music data
inferred← citeshttps://doi.org/10.1109/dcc.1998.672138openalex-snapshot
Some theory and practice of greedy off-line textual substitution
inferred← citeshttps://doi.org/10.1109/dcc.1999.755666openalex-snapshot
Linear global detectors of redundant and rare substrings
inferred← citeshttps://doi.org/10.1109/dcc.2004.1281452openalex-snapshot
Motifs in ziv-Lempel-Welch clef
inferred← citeshttps://doi.org/10.1109/dcc.2008.105openalex-snapshot
Table Compression by Record Intersections
inferred← citeshttps://doi.org/10.1109/icde.1999.754893openalex-snapshot
Efficient theme and non-trivial repeating pattern discovering in music databases
inferred← citeshttps://doi.org/10.1109/sequen.1997.666917openalex-snapshot
Annotated statistical indices for sequence analysis
inferred← citeshttps://doi.org/10.1145/2390176.2390189openalex-snapshot
Cycle detection and correction
inferred← citeshttps://doi.org/10.1145/2810036openalex-snapshot
40 years of suffix trees
inferred← citeshttps://doi.org/10.3233/fi-2020-1874openalex-snapshot
Some Investigations on Similarity Measures Based on Absent Words
inferred← citeshttps://doi.org/10.3390/a2041429openalex-snapshot
Linear-Time Text Compression by Longest-First Substitution
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2017.22openalex-snapshot
Computing All Distinct Squares in Linear Time for Integer Alphabets
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1359openalex-snapshot
Improved Algorithms for the Range Next Value Problem and Applications
inferred← citeshttps://doi.org/10.4310/cis.2009.v9.n3.a2openalex-snapshot
Ask Not What Stringology Can Do for You: Advances in Pattern Matching Driven by Computational Biology
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0163openalex-snapshot
Fast Algorithm for Partial Covers in Words
inferred← citeshttps://doi.org/10.7146/brics.v6i25.20094openalex-snapshot
Finding Maximal Quasiperiodicities in Strings
inferred← citeshttps://doi.org/10.7146/brics.v9i13.21731openalex-snapshot
Solving the String Statistics Problem in Time O(n log n)
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.