On the public citation graph
A linear-time algorithm for finding approximate shortest common superstrings
0 signed · 57 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9780470479216.corpsy0440openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1007/bfb0016287openalex-snapshot
A greedy algorithm for constructing shortest common superstrings
inferredcites →https://doi.org/10.1016/0022-0000(80)90004-5openalex-snapshot
On finding minimal length superstrings
inferredcites →https://doi.org/10.1016/0304-3975(88)90167-3openalex-snapshot
A greedy approximation algorithm for constructing shortest common superstrings
inferredcites →https://doi.org/10.1016/0890-5401(89)90044-8openalex-snapshot
Approximation algorithms for the shortest common superstring problem
inferredcites →https://doi.org/10.1093/nar/10.15.4731openalex-snapshot
Automation of the computer handling of gel reading data produced by the shotgun method of DNA sequencing
inferredcites →https://doi.org/10.1093/nar/12.1part1.307openalex-snapshot
SEQAID: a DNA sequence assembling program based on a mathematical model
inferredcites →https://doi.org/10.1093/nar/7.2.529openalex-snapshot
Computer programs for the assembly of DNA sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.672openalex-snapshot
The effect of multiple reference characters on detecting matches in string-searching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_64openalex-snapshot
Combinatorial optimization through order statistics
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_56openalex-snapshot
Greedy algorithms for the shortest common superstring that are asymtotically optimal
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_13openalex-snapshot
Reconstructing sequences from shotgun data
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_16openalex-snapshot
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-86692-1_6openalex-snapshot
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_21openalex-snapshot
Practical Algorithms for Hierarchical Overlap Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_1openalex-snapshot
Greedy Shortest Common Superstring Approximation in Compact Space
inferred← citeshttps://doi.org/10.1007/bf01188580openalex-snapshot
Combinatorial algorithms for DNA sequence assembly
inferred← citeshttps://doi.org/10.1007/pl00009207openalex-snapshot
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90176-vopenalex-snapshot
An efficient algorithm for the All Pairs Suffix-Prefix Problem
inferred← citeshttps://doi.org/10.1016/0895-7177(92)90166-iopenalex-snapshot
A bibliography on computational molecular biology and genetics
inferred← citeshttps://doi.org/10.1016/1049-9660(91)90020-popenalex-snapshot
Image analysis and computer vision: 1990
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.020openalex-snapshot
About the design of oligo-chips
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.027openalex-snapshot
Optimal prefix and suffix queries on texts
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.11.015openalex-snapshot
On the greedy algorithm for the Shortest Common Superstring problem with reversals
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106275openalex-snapshot
All-pairs suffix/prefix in optimal time using Aho-Corasick space
inferred← citeshttps://doi.org/10.1016/j.jda.2016.05.001openalex-snapshot
A linear time algorithm for Shortest Cyclic Cover of Strings
inferred← citeshttps://doi.org/10.1080/02331939508844086openalex-snapshot
Combinational optimization problems for which almost every algorithm is asymptotically optimal
inferred← citeshttps://doi.org/10.1101/2023.02.01.526717openalex-snapshot
Masked superstrings as a unified framework for textual k -mer set representations
inferred← citeshttps://doi.org/10.1101/2024.10.30.621029openalex-snapshot
FroM Superstring to Indexing: a space-efficient index for unconstrained k -mer sets using the Masked Burrows-Wheeler Transform (MBWT)
inferred← citeshttps://doi.org/10.1109/hicss.1992.183217openalex-snapshot
Optimistically building a consensus sequence using F-inexact matches (DNA)
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323672openalex-snapshot
Falcon: Accelerating Homomorphically Encrypted Convolutions for Efficient Private Mobile Network Inference
inferred← citeshttps://doi.org/10.1109/isit.1997.612954openalex-snapshot
Greedy algorithms for the shortest common superstring that are asymptotically optimal
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174488openalex-snapshot
The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion Channels
inferred← citeshttps://doi.org/10.1109/tit.2013.2270273openalex-snapshot
Information Theory of DNA Shotgun Sequencing
inferred← citeshttps://doi.org/10.1109/tpds.2012.19openalex-snapshot
pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792190157openalex-snapshot
Parallel Suffix–Prefix-Matching Algorithm and Applications
inferred← citeshttps://doi.org/10.1142/s0129054105003662openalex-snapshot
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
inferred← citeshttps://doi.org/10.1142/s0129065799000563openalex-snapshot
DNA FRAGMENT ASSEMBLY USING NEURAL PREDICTION TECHNIQUES
inferred← citeshttps://doi.org/10.1145/1287624.1287681openalex-snapshot
Measuring empirical computational complexity
inferred← citeshttps://doi.org/10.1145/225058.225108openalex-snapshot
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
inferred← citeshttps://doi.org/10.11606/d.59.2019.tde-27022019-092802openalex-snapshot
Similarity algorithms for Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1177/15578666261491601openalex-snapshot
Pareto Optimization of Masked Superstrings Improves Compression of Pan-Genome k -Mer Sets
inferred← citeshttps://doi.org/10.1201/9781584888239-c11openalex-snapshot
Average Case Analysis of Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.26openalex-snapshot
Collapsing Superstring Conjecture
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2021.17openalex-snapshot
Optimal Construction of Hierarchical Overlap Graphs
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2021.22openalex-snapshot
A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs
inferred← citeshttps://doi.org/10.4230/lipics.sea.2018.18openalex-snapshot
Practical lower and upper bounds for the Shortest Linear Superstring
inferred← citeshttps://doi.org/10.48550/arxiv.1707.07727openalex-snapshot
Greedy Shortest Common Superstring Approximation in Compact Space
inferred← citeshttps://doi.org/10.48550/arxiv.2001.05582openalex-snapshot
The Error Probability of Maximum-Likelihood Decoding over Two Deletion Channels
inferred← citeshttps://doi.org/10.5281/zenodo.1083622openalex-snapshot
Approximation Algorithm For The Shortest Approximate Common Superstring Problem
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.