On the public citation graph

Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version

https://doi.org/10.1007/bfb0030787
0 signed · 39 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/3-540-58094-8_13openalex-snapshot
Computation of squares in a string
inferredcites →https://doi.org/10.1007/978-1-4613-9323-8_12openalex-snapshot
Periodic Prefixes in Texts
inferredcites →https://doi.org/10.1007/978-3-642-82456-2openalex-snapshot
Combinatorial Algorithms on Words
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_18openalex-snapshot
Linear Time Recognition of Squarefree Strings
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.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferredcites →https://doi.org/10.1007/bfb0029801openalex-snapshot
An algorithm for approximate tandem repeats
inferredcites →https://doi.org/10.1016/0020-0190(81)90024-7openalex-snapshot
An optimal algorithm for computing the repetitions in a word
inferredcites →https://doi.org/10.1016/0196-6774(84)90021-xopenalex-snapshot
An O(n log n) algorithm for finding all repetitions in a string
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.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1109/sfcs.1997.646102openalex-snapshot
Optimal suffix tree construction with large alphabets
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.5860/choice.32-5696openalex-snapshot
Text algorithms

What points at this work

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

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-45678-3_62openalex-snapshot
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
inferred← citeshttps://doi.org/10.1007/3-540-48194-x_17openalex-snapshot
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_31openalex-snapshot
On maximal repetitions in words
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_11openalex-snapshot
Finding Maximal Pairs with Bounded Gap
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-25005-8_7openalex-snapshot
Finding Periods in Cartesian Tree Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_42openalex-snapshot
Analysis of Maximal Repetitions in Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_6openalex-snapshot
A Minimal Periods Algorithm with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_2openalex-snapshot
On the Maximal Sum of Exponents of Runsin a String
inferred← citeshttps://doi.org/10.1007/978-3-642-31837-5_17openalex-snapshot
Locating Tandem Repeats in Weighted Biological Sequences
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.09.003openalex-snapshot
Maximal repetitions in strings
inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.016openalex-snapshot
On the maximal sum of exponents of runs in a string
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00121-9openalex-snapshot
Simple and flexible detection of contiguous repeats using a suffix tree
inferred← citeshttps://doi.org/10.1109/csb.2004.109openalex-snapshot
Locating all tandem repeat families in a sequence
inferred← citeshttps://doi.org/10.1109/discex.2003.1194881openalex-snapshot
Finding the vocabulary of program behavior data for anomaly detection
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814634openalex-snapshot
Finding maximal repetitions in a word in linear time
inferred← citeshttps://doi.org/10.1109/spire.2000.878192openalex-snapshot
Finding repeats with fixed gap
inferred← citeshttps://doi.org/10.1186/1471-2105-14-s8-s2openalex-snapshot
Locating tandem repeats in weighted sequences in proteins
inferred← citeshttps://doi.org/10.1504/ijbra.2009.027517openalex-snapshot
Application of the Burrows-Wheeler Transform for searching for tandem repeats in DNA sequences
inferred← citeshttps://doi.org/10.25596/jalc-2005-687openalex-snapshot
Computing the Repetitions in a Biological Weighted Sequence
inferred← citeshttps://doi.org/10.3233/jcm-2005-5303openalex-snapshot
Discovering regularities in biosequences: Challenges and applications
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.