On the public citation graph

Covering a string

https://doi.org/10.1007/bf01955677
0 signed · 63 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.1016/0020-0190(81)90024-7openalex-snapshot
An optimal algorithm for computing the repetitions in a word
inferredcites →https://doi.org/10.1016/0020-0190(91)90056-nopenalex-snapshot
Optimal superprimitivity testing for strings
inferredcites →https://doi.org/10.1016/0020-0190(92)90111-8openalex-snapshot
An on-line string superprimitivity test
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.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/0304-3975(93)90159-qopenalex-snapshot
Efficient detection of quasiperiodicities in strings
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.5555/314464.314633openalex-snapshot
The subtree max gap problem with application to parallel string covering

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11775096_28openalex-snapshot
Computing the λ-Seeds of a String
inferred← citeshttps://doi.org/10.1007/3-540-44411-4_19openalex-snapshot
Fast Evolutionary Chains
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_24openalex-snapshot
Evolutive Tandem Repeats Using Hamming Distance
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_10openalex-snapshot
Approximate Periods of Strings
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-030-59212-7_10openalex-snapshot
Computing Covers Under Substring Consistent Equivalence Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_5openalex-snapshot
Internal Quasiperiod Queries
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_8openalex-snapshot
Approximating the Anticover of a String
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_7openalex-snapshot
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_1openalex-snapshot
Testing Quasiperiodicity
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-13075-0_18openalex-snapshot
Covering Problems for Partial Words and for Indeterminate Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-14355-7_28openalex-snapshot
Varieties of Regularities in Weighted Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_30openalex-snapshot
Efficient Seeds Computation Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_43openalex-snapshot
On the Right-Seed Array of a String
inferred← citeshttps://doi.org/10.1007/978-3-642-31588-6_16openalex-snapshot
Computing the Minimum λ-Cover in Weighted Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_8openalex-snapshot
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time
inferred← citeshttps://doi.org/10.1007/bfb0030786openalex-snapshot
Constructing suffix arrays for multi-dimensional matrices
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-019-00559-8openalex-snapshot
Can We Recover the Cover?
inferred← citeshttps://doi.org/10.1007/s00453-021-00842-7openalex-snapshot
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.010openalex-snapshot
Computing regularities in strings: A survey
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.08.005openalex-snapshot
Two strings at Hamming distance 1 cannot be both quasiperiodic
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.007openalex-snapshot
Computing maximal-exponent factors in an overlap-free word
inferred← citeshttps://doi.org/10.1016/j.jda.2012.10.004openalex-snapshot
On left and right seeds of a string
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.078openalex-snapshot
Efficient seed computation revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.035openalex-snapshot
Efficient algorithms for shortest partial seeds in words
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.026openalex-snapshot
Covering problems for partial words and for indeterminate strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.020openalex-snapshot
Approximate cover of strings
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.2021.03.011openalex-snapshot
Shortest covers of all cyclic shifts of a string
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00067-0openalex-snapshot
Repetitive perhaps, but certainly not boring
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00365-0openalex-snapshot
Approximate periods of strings
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/s0304-3975(03)00423-7openalex-snapshot
Speeding up the detection of evolutive tandem repeats
inferred← citeshttps://doi.org/10.1080/00207160213939openalex-snapshot
Algorithms For Computing Approximate Repetitions In Musical Sequences
inferred← citeshttps://doi.org/10.1080/00207160701389168openalex-snapshot
Generalized approximate regularities in strings
inferred← citeshttps://doi.org/10.1142/s0129054106003930openalex-snapshot
COVERS FROM TEMPLATES
inferred← citeshttps://doi.org/10.1142/s0129054112500190openalex-snapshot
IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
inferred← citeshttps://doi.org/10.1145/3386369openalex-snapshot
A Linear-Time Algorithm for Seeds Computation
inferred← citeshttps://doi.org/10.1525/mp.2006.23.3.249openalex-snapshot
Musical Parallelism and Melodic Segmentation
inferred← citeshttps://doi.org/10.25596/jalc-2001-291openalex-snapshot
On-Line Validation and Analysis of Partially Occluded Images
inferred← citeshttps://doi.org/10.25596/jalc-2005-003openalex-snapshot
A Language-Theoretic Approach to Covering Problems
inferred← citeshttps://doi.org/10.3233/fi-222164openalex-snapshot
String Covering: A Survey
inferred← citeshttps://doi.org/10.3233/jcm-2005-5303openalex-snapshot
Discovering regularities in biosequences: Challenges and applications
inferred← citeshttps://doi.org/10.37236/1604openalex-snapshot
Computing Evolutionary Chains in Musical Sequences
inferred← citeshttps://doi.org/10.3934/medsci.2017.3.261openalex-snapshot
The Role of The Prefix Array in Sequence Analysis: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1201.6162openalex-snapshot
Quasiperiodicities in Fibonacci strings
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1307openalex-snapshot
Identifying all abelian periods of a string in quadratic time and relevant problems
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0163openalex-snapshot
Fast Algorithm for Partial Covers in Words
inferred← citeshttps://doi.org/10.48550/arxiv.1703.00195openalex-snapshot
Two strings at Hamming distance 1 cannot be both quasiperiodic
inferred← citeshttps://doi.org/10.70675/a61f77f4z0662z41e2z8db6zc2604537b1c1openalex-snapshot
Sketch-based approaches to process massive string data
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.