On the public citation graph
https://doi.org/10.2139/ssrn.4148185
0 signed · 21 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.1007/978-1-4899-6846-3openalex-extracted
Introduction to Computational Biology
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_42openalex-extracted
Measurement Errors Make the Partial Digest Problem NP-Hard
inferredcites →https://doi.org/10.1007/978-3-540-39763-2_8openalex-extracted
New Algorithm for the Simplified Partial Digest Problem
inferredcites →https://doi.org/10.1007/978-3-540-39763-2_9openalex-extracted
Noisy Data Make the Partial Digest Problem NP-hard
inferredcites →https://doi.org/10.1007/978-3-642-55566-4_27openalex-extracted
Reconstructing Sets From Interpoint Distances
inferredcites →https://doi.org/10.1007/s13160-011-0041-1openalex-extracted
A fast algorithm for the partial digest problem
inferredcites →https://doi.org/10.1016/0196-8858(91)90028-hopenalex-extracted
Multiple solutions of DNA restriction mapping problems
inferredcites →https://doi.org/10.1016/j.dam.2009.04.017openalex-extracted
On the approximability of the Simplified Partial Digest Problem
inferredcites →https://doi.org/10.1016/j.ejor.2010.07.027openalex-extracted
The simplified partial digest problem: Approximation and a graph-theoretic model
inferredcites →https://doi.org/10.1016/j.tcs.2005.05.021openalex-extracted
Some necessary clarifications about the chords’ problem and the Partial Digest Problem
inferredcites →https://doi.org/10.1016/s0092-8240(05)80259-9openalex-extracted
A partial digest approach to restriction site mapping
inferredcites →https://doi.org/10.1051/ro:2006007openalex-extracted
Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
inferredcites →https://doi.org/10.1089/cmb.1994.1.235openalex-extracted
An Exponential Example for a Partial Digest Mapping Algorithm
inferredcites →https://doi.org/10.1089/cmb.2016.0044openalex-extracted
A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n 2 Pairwise Distances in n 2 Steps for the Sequencing Problem: I. Theory
inferredcites →https://doi.org/10.1089/cmb.2016.0046openalex-extracted
A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n 2 Pairwise Distances in n 2 Steps for the Sequencing Problem: II. Algorithm
inferredcites →https://doi.org/10.1089/cmb.2021.0641openalex-extracted
Fast Algorithms for the Simplified Partial Digest Problem
inferredcites →https://doi.org/10.1093/bioinformatics/17.5.398openalex-extracted
Construction of DNA restriction maps based on a simplified experiment
inferredcites →https://doi.org/10.1109/tcbb.2007.1060openalex-extracted
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms
inferredcites →https://doi.org/10.1186/s12859-016-1365-2openalex-extracted
A fast exact sequential algorithm for the partial digest problem
inferredcites →https://doi.org/10.26713/jims.v10i1-2.611openalex-extracted
Speeding Up the Partial Digest Algorithm
inferredcites →https://doi.org/10.7551/mitpress/2022.001.0001openalex-extracted
Computational Molecular Biology
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.