On the public citation graph

Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal

https://doi.org/10.1007/pl00009207
0 signed · 50 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.1002/0471200611openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1006/jagm.1997.0861openalex-snapshot
Rotations of Periodic Strings and Short Superstrings
inferredcites →https://doi.org/10.1007/3-540-58218-5_9openalex-snapshot
Parallel and sequential approximation of shortest superstrings
inferredcites →https://doi.org/10.1007/3-540-61258-0_8openalex-snapshot
A 2 2/3-approximation algorithm for the shortest superstring problem
inferredcites →https://doi.org/10.1007/bf01759045openalex-snapshot
On the height of digital trees and related problems
inferredcites →https://doi.org/10.1007/bf01840391openalex-snapshot
A linear-time algorithm for finding approximate shortest common superstrings
inferredcites →https://doi.org/10.1007/bf02773685openalex-snapshot
The positive-divergence and blowing-up properties
inferredcites →https://doi.org/10.1007/bfb0029808openalex-snapshot
Approximate string-matching over suffix trees
inferredcites →https://doi.org/10.1016/0020-0190(88)90137-8openalex-snapshot
The evaluation of an alternative sum with applications to the analysis of some data structures
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(94)00281-mopenalex-snapshot
Mellin transforms and asymptotics: Finite differences and Rice's integrals
inferredcites →https://doi.org/10.1016/s0022-5193(88)80246-7openalex-snapshot
A novel method for nucleic acid sequence determination
inferredcites →https://doi.org/10.1080/07391102.1989.10507752openalex-snapshot
l-Tuple DNA Sequencing: Computer Analysis
inferredcites →https://doi.org/10.1089/cmb.1995.2.307openalex-snapshot
Short Superstrings and the Structure of Overlapping Strings
inferredcites →https://doi.org/10.1109/18.133271openalex-snapshot
Analysis of digital tries with Markovian dependency
inferredcites →https://doi.org/10.1109/18.782108openalex-snapshot
The shortest common superstring problem: average case analysis for both exact and approximate matching
inferredcites →https://doi.org/10.1109/isit.1995.531182openalex-snapshot
A lossy data compression based on an approximate pattern matching
inferredcites →https://doi.org/10.1109/sfcs.1993.366871openalex-snapshot
Approximating shortest superstrings
inferredcites →https://doi.org/10.1109/sfcs.1994.365696openalex-snapshot
Long tours and short superstrings
inferredcites →https://doi.org/10.1137/0222070openalex-snapshot
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
inferredcites →https://doi.org/10.1145/179812.179818openalex-snapshot
Linear approximation of shortest superstrings
inferredcites →https://doi.org/10.1214/aop/1176989934openalex-snapshot
Entropy and Prefixes
inferredcites →https://doi.org/10.2307/1401263openalex-snapshot
Ergodic Theory and Information
inferredcites →https://doi.org/10.2307/2003618openalex-snapshot
Ergodic Theory and Information
inferredcites →https://doi.org/10.2307/2343508openalex-snapshot
Ergodic Theory and Information.
inferredcites →https://doi.org/10.5860/choice.27-1526openalex-snapshot
Computational molecular biology: sources and methods for sequence analysis
inferredcites →https://doi.org/10.7146/brics.v3i21.19984openalex-snapshot
Rotation of Periodic Strings and Short Superstrings

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032770.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-1-4939-0808-0_10openalex-snapshot
The Shortest Superstring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24855-2_104openalex-snapshot
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_23openalex-snapshot
Why Greed Works for Shortest Common Superstring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_53openalex-snapshot
A Probabilistic PTAS for Shortest Common Superstring
inferred← citeshttps://doi.org/10.1007/bf02679622openalex-snapshot
Dynamical sources in information theory: Fundamental intervals and word prefixes
inferred← citeshttps://doi.org/10.1007/s10878-013-9622-zopenalex-snapshot
A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
inferred← citeshttps://doi.org/10.1016/j.jco.2005.04.002openalex-snapshot
The shifted number system for fast linear algebra on integer matrices
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.014openalex-snapshot
Why greed works for shortest common superstring problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.005openalex-snapshot
A probabilistic PTAS for shortest common superstring
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00212-2openalex-snapshot
Limit laws for the height in PATRICIA tries
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.1109/18.623143openalex-snapshot
A suboptimal lossy data compression based on approximate pattern matching
inferred← citeshttps://doi.org/10.1109/18.782108openalex-snapshot
The shortest common superstring problem: average case analysis for both exact and approximate matching
inferred← citeshttps://doi.org/10.1109/icassp.2018.8461796openalex-snapshot
Multi-Segment Reconstruction Using Invariant Features
inferred← citeshttps://doi.org/10.1109/isit.2012.6284020openalex-snapshot
Information theory for DNA sequencing: Part I: A basic model
inferred← citeshttps://doi.org/10.1109/sequen.1997.666920openalex-snapshot
On the approximate pattern occurrences in a text
inferred← citeshttps://doi.org/10.1109/tevc.2004.831260openalex-snapshot
The Preservation of Favored Building Blocks in the Struggle for Fitness: The Puzzle Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2013.2270273openalex-snapshot
Information Theory of DNA Shotgun Sequencing
inferred← citeshttps://doi.org/10.1145/3519935.3520001openalex-snapshot
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios
inferred← citeshttps://doi.org/10.1201/9781584888239-c11openalex-snapshot
Average Case Analysis of Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6233openalex-snapshot
Information Theory of DNA Shotgun Sequencing
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05105openalex-snapshot
Assembling sequences of DNA using an on-line algorithm based on DeBruijn graphs
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.