On the public citation graph

An algorithm for approximate tandem repeats

https://doi.org/10.1007/bfb0029801
0 signed · 76 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-12689-9_129openalex-snapshot
On approximate string matching
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/bf01758848openalex-snapshot
Optimal parallel detection of squares in strings
inferredcites →https://doi.org/10.1007/bfb0029798openalex-snapshot
An algorithm for locating non-overlapping regions of maximum alignment score
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(84)90021-xopenalex-snapshot
An O(n log n) algorithm for finding all repetitions in a string
inferredcites →https://doi.org/10.1016/s1380-7323(99)x8057-5openalex-snapshot
Computational Molecular Biology
inferredcites →https://doi.org/10.1093/nar/22.22.4828openalex-snapshot
A method for fast database search for allk-nucleotide repeats
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings

What points at this work

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

inferred← citeshttps://doi.org/10.1002/047134608x.w1608openalex-snapshot
Biology Computing
inferred← citeshttps://doi.org/10.1006/mben.2000.0151openalex-snapshot
The Emergence of Pattern Discovery Techniques in Computational Biology
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_8openalex-snapshot
Pattern Inference under many Guises
inferred← citeshttps://doi.org/10.1007/11575832_21openalex-snapshot
Linear Time Algorithm for the Generalised Longest Common Repeat Problem
inferred← citeshttps://doi.org/10.1007/11775300_34openalex-snapshot
A New Method for Finding Approximate Repetitions in DNA Sequences
inferred← citeshttps://doi.org/10.1007/11960669_15openalex-snapshot
Discovering Consensus Patterns in Biological Databases
inferred← citeshttps://doi.org/10.1007/3-540-44411-4_19openalex-snapshot
Fast Evolutionary Chains
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_14openalex-snapshot
Finding Approximate Repetitions under Hamming Distance
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_10openalex-snapshot
Approximate Periods of Strings
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_11openalex-snapshot
Finding Maximal Pairs with Bounded Gap
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_1openalex-snapshot
A space efficient algorithm for finding the best non-overlapping alignment score
inferred← citeshttps://doi.org/10.1007/978-3-322-80043-5_9openalex-snapshot
Bestimmung von Signalen in DNA-Sequenzen
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_13openalex-snapshot
An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_2openalex-snapshot
Linear Time Algorithm for the Longest Common Repeat Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_9openalex-snapshot
Correlations of Partial Words
inferred← citeshttps://doi.org/10.1007/978-3-540-71913-7_9openalex-snapshot
Finding Signals in DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_12openalex-snapshot
Two Element Unavoidable Sets of Partial Words
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_27openalex-snapshot
Avoiding Approximate Squares
inferred← citeshttps://doi.org/10.1007/978-3-540-78291-9_2openalex-snapshot
Open Problems on Partial Words
inferred← citeshttps://doi.org/10.1007/bfb0030787openalex-snapshot
Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version
inferred← citeshttps://doi.org/10.1007/bfb0030789openalex-snapshot
Fixed topology alignment with recombination
inferred← citeshttps://doi.org/10.1007/s00453-019-00559-8openalex-snapshot
Can We Recover the Cover?
inferred← citeshttps://doi.org/10.1016/0304-3975(95)92848-ropenalex-snapshot
A space efficient algorithm for finding the best nonoverlapping alignment score
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.009openalex-snapshot
New simple efficient algorithms computing powers and runs in strings
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.03.004openalex-snapshot
Linear time algorithms for finding and representing all the tandem repeats in a string
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.019openalex-snapshot
Linear time algorithm for the longest common repeat problem
inferred← citeshttps://doi.org/10.1016/j.jda.2007.02.003openalex-snapshot
Discovering subword associations in strings in time linear in the output size
inferred← citeshttps://doi.org/10.1016/j.mcm.2005.09.013openalex-snapshot
Implementing approximate regularities
inferred← citeshttps://doi.org/10.1016/s0097-8485(00)80007-8openalex-snapshot
Detecting localized repeats in genomic sequences: A new strategy and its application to Bacillus subtilis and Arabidopsis thaliana sequences
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00074-2openalex-snapshot
Reconstructing a history of recombinations from a set of sequences
inferred← citeshttps://doi.org/10.1016/s0167-7152(02)00337-1openalex-snapshot
The exact distribution of the k-tuple statistic for sequence homology
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(01)00121-9openalex-snapshot
Simple and flexible detection of contiguous repeats using a suffix tree
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00448-6openalex-snapshot
Finding approximate repetitions under Hamming distance
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.1016/s0888-7543(03)00076-4openalex-snapshot
An exhaustive DNA micro-satellite map of the human genome using high performance computing
inferred← citeshttps://doi.org/10.1017/cbo9780511843204openalex-snapshot
Analytic Pattern Matching
inferred← citeshttps://doi.org/10.1080/00207160213939openalex-snapshot
Algorithms For Computing Approximate Repetitions In Musical Sequences
inferred← citeshttps://doi.org/10.1089/106652701300099038openalex-snapshot
An Algorithm for Approximate Tandem Repeats
inferred← citeshttps://doi.org/10.1089/cmb.1997.4.351openalex-snapshot
Sequence Alignment with Tandem Duplication
inferred← citeshttps://doi.org/10.1089/cmb.1998.5.87openalex-snapshot
On the Distribution of K -tuple Matches for Sequence Homology: A Constant Time Exact Calculation of the Variance
inferred← citeshttps://doi.org/10.1093/bioinformatics/btl309openalex-snapshot
Tandem repeats over the edit distance
inferred← citeshttps://doi.org/10.1093/ietisy/e90-d.12.2096openalex-snapshot
A Simple Algorithm for Finding Exact Common Repeats
inferred← citeshttps://doi.org/10.1093/nar/gkg617openalex-snapshot
mreps: efficient and flexible detection of tandem repeats in DNA
inferred← citeshttps://doi.org/10.1109/bibe.2006.253314openalex-snapshot
Partition Frequency Distance based Filter Method for Finding Approximate Repetitions in DNA Sequences
inferred← citeshttps://doi.org/10.1109/iccsit.2009.5234544openalex-snapshot
Computing regularities in strings
inferred← citeshttps://doi.org/10.1109/icdm.2007.75openalex-snapshot
Efficient Discovery of Frequent Approximate Sequential Patterns
inferred← citeshttps://doi.org/10.1109/icsps.2010.5555809openalex-snapshot
A new method for finding approximate repetitions in DNA sequences
inferred← citeshttps://doi.org/10.1109/inbs.1995.404256openalex-snapshot
A first step toward chromosome analysis by compression algorithms
inferred← citeshttps://doi.org/10.1109/istcs.1995.377044openalex-snapshot
All shortest paths in weighted grid graphs and its application to finding all approximate repeats in strings
inferred← citeshttps://doi.org/10.1109/tsp.2003.815396openalex-snapshot
Detection and visualization of tandem repeats in dna sequences
inferred← citeshttps://doi.org/10.1137/s0097539794262677openalex-snapshot
An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
inferred← citeshttps://doi.org/10.1137/s0097539794264810openalex-snapshot
Incremental String Comparison
inferred← citeshttps://doi.org/10.1137/s0097539795288489openalex-snapshot
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
inferred← citeshttps://doi.org/10.1142/9789812704658_0036openalex-snapshot
IMPLEMENTING APPROXIMATE REGULARITIES EXTENDED ABSTRACT
inferred← citeshttps://doi.org/10.1145/1216262.1216289openalex-snapshot
FireμSat
inferred← citeshttps://doi.org/10.1145/267521.267526openalex-snapshot
Sequence alignment with tandem duplication
inferred← citeshttps://doi.org/10.1145/279069.279079openalex-snapshot
An algorithm for finding tandem repeats of unspecified pattern size
inferred← citeshttps://doi.org/10.1145/279069.279120openalex-snapshot
Identifying satellites in nucleic acid sequences
inferred← citeshttps://doi.org/10.1186/1748-7188-1-2openalex-snapshot
Finding the region of pseudo-periodic tandem repeats in biological sequences
inferred← citeshttps://doi.org/10.1186/1748-7188-7-10openalex-snapshot
Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis
inferred← citeshttps://doi.org/10.1201/9781420085877.ch4openalex-snapshot
Mining Frequent Approximate Sequential Patterns
inferred← citeshttps://doi.org/10.37236/1604openalex-snapshot
Computing Evolutionary Chains in Musical Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1607.06660openalex-snapshot
Fast Longest Common Extensions in Small Space
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06604openalex-snapshot
Update Query Time Trade-off for dynamic Suffix Arrays
inferred← citeshttps://doi.org/10.5555/314464.314626openalex-snapshot
Reconstructing a history of recombinations from a set of sequences
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.