On the public citation graph

An algorithm for locating non-overlapping regions of maximum alignment score

https://doi.org/10.1007/bfb0029798
0 signed · 35 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/bf01840446openalex-snapshot
AnO(ND) difference algorithm and its variations
inferredcites →https://doi.org/10.1016/0022-2836(81)90087-5openalex-snapshot
Identification of common molecular subsequences
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.1137/0219066openalex-snapshot
Efficient Parallel Algorithms for String Editing and Related Problems
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem

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/jagm.2001.1191openalex-snapshot
On the Common Substring Alignment Problem
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_8openalex-snapshot
Pattern Inference under many Guises
inferred← citeshttps://doi.org/10.1007/11496656_18openalex-snapshot
On the Complexity of Sparse Exon Assembly
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_17openalex-snapshot
Sparse LCS Common Substring Alignment
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-642-02788-8_9openalex-snapshot
String Mining in Bioinformatics
inferred← citeshttps://doi.org/10.1007/bfb0029801openalex-snapshot
An algorithm for approximate tandem repeats
inferred← citeshttps://doi.org/10.1007/bfb0030789openalex-snapshot
Fixed topology alignment with recombination
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.ipl.2003.09.006openalex-snapshot
Sparse LCS Common Substring Alignment
inferred← citeshttps://doi.org/10.1016/s0020-0255(00)00014-1openalex-snapshot
Identifying consensus of trees through alignment
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.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.1090/dimacs/047/05openalex-snapshot
Sequence alignment in molecular biology
inferred← citeshttps://doi.org/10.1109/fccm.2010.21openalex-snapshot
Hardware Acceleration of Approximate Tandem Repeat Detection
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.1137/s0097539794262677openalex-snapshot
An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
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.1145/1998076.1998106openalex-snapshot
Indexing musical pieces using their major repetition
inferred← citeshttps://doi.org/10.1145/2009916.2010102openalex-snapshot
Towards an indexing method to speed-up music retrieval
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.1145/974614.974644openalex-snapshot
Finding approximate tandem repeats in genomic sequences
inferred← citeshttps://doi.org/10.48550/arxiv.0707.3409openalex-snapshot
Faster exon assembly by sparse spliced alignment
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.