On the public citation graph
A partial digest approach to restriction site mapping
0 signed · 72 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.1006/aama.1993.1009openalex-snapshot
A Lower Bound on the Number of Solutions to the Probed Partial Digest Problem
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1016/0004-3702(78)90013-9openalex-snapshot
Inferring DNA structures from segmentation data
inferredcites →https://doi.org/10.1016/0097-3165(89)90022-8openalex-snapshot
A useful elementary correlation inequality
inferredcites →https://doi.org/10.1016/0196-8858(87)90013-3openalex-snapshot
Mapping DNA by stochastic relaxation
inferredcites →https://doi.org/10.1089/cmb.1994.1.235openalex-snapshot
An Exponential Example for a Partial Digest Mapping Algorithm
inferredcites →https://doi.org/10.1093/bioinformatics/4.1.103openalex-snapshot
Restriction map construction using a ‘complete sentences compatibility’ algorithm
inferredcites →https://doi.org/10.1093/bioinformatics/4.1.111openalex-snapshot
Construction of restriction maps
inferredcites →https://doi.org/10.1093/bioinformatics/4.1.117openalex-snapshot
Errors between sites in restriction site mapping
inferredcites →https://doi.org/10.1093/bioinformatics/4.1.97openalex-snapshot
Restriction site mapping is in separation theory
inferredcites →https://doi.org/10.1093/bioinformatics/6.2.107openalex-snapshot
Mapping DNA by stochastic relaxation: a new approach to fragment sizes
inferredcites →https://doi.org/10.1093/bioinformatics/6.3.195openalex-snapshot
Restriction site mapping for three or more enzymes
inferredcites →https://doi.org/10.1093/bioinformatics/8.1.1openalex-snapshot
Using fragment lengths from incomplete digestion by multiply cleaving enzymes to map antibody binding sites on a protein
inferredcites →https://doi.org/10.1103/physrev.65.195openalex-snapshot
Ambiguities in the X-Ray Analysis of Crystal Structures
inferredcites →https://doi.org/10.1524/zkri.1935.90.1.517openalex-snapshot
A Direct Method for the Determination of the Components of Interatomic Distances in Crystals
inferredcites →https://doi.org/10.7936/k7hx1b2mopenalex-snapshot
DNA Restriction Mapping from Random-Clone Data
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-0716-3989-4_13openalex-snapshot
A Scalable Optimization Algorithm for Solving the Beltway and Turnpike Problems with Uncertain Measurements
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_42openalex-snapshot
Measurement Errors Make the Partial Digest Problem NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_34openalex-snapshot
Sequencing from Compomers: Using Mass Spectrometry for DNA De-Novo Sequencing of 200+ nt
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_8openalex-snapshot
New Algorithm for the Simplified Partial Digest Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39763-2_9openalex-snapshot
Noisy Data Make the Partial Digest Problem NP-hard
inferred← citeshttps://doi.org/10.1007/978-3-540-78839-3_16openalex-snapshot
De Novo Sequencing of Nonribosomal Peptides
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_16openalex-snapshot
Reconstructing Numbers from Pairwise Function Values
inferred← citeshttps://doi.org/10.1007/978-3-642-20036-6_24openalex-snapshot
Multiplex De Novo Sequencing of Peptide Antibiotics
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_27openalex-snapshot
Reconstructing Sets From Interpoint Distances
inferred← citeshttps://doi.org/10.1007/s00224-005-1238-yopenalex-snapshot
Sequencing from Compomers: The Puzzle
inferred← citeshttps://doi.org/10.1007/s00454-005-1169-zopenalex-snapshot
Sums, Projections, and Sections of Lattice Sets, and the Discrete Covariogram
inferred← citeshttps://doi.org/10.1007/s00493-024-00119-xopenalex-snapshot
Reconstruction in One Dimension from Unlabeled Euclidean Lengths
inferred← citeshttps://doi.org/10.1007/s10898-017-0579-9openalex-snapshot
The minimum distance superset problem: formulations and algorithms
inferred← citeshttps://doi.org/10.1007/s10898-018-0693-3openalex-snapshot
Preface: Special issue dedicated to Distance Geometry
inferred← citeshttps://doi.org/10.1007/s13160-011-0041-1openalex-snapshot
A fast algorithm for the partial digest problem
inferred← citeshttps://doi.org/10.1016/j.acha.2024.101723openalex-snapshot
The beltway problem over orthogonal groups
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.01.003openalex-snapshot
Computational geometric aspects of rhythm, melody, and voice-leading
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.017openalex-snapshot
On the approximability of the Simplified Partial Digest Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2024.02.018openalex-snapshot
An impossible combinatorial counting method in distance geometry
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.10.054openalex-snapshot
Selected combinatorial problems of computational biology
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.07.027openalex-snapshot
The simplified partial digest problem: Approximation and a graph-theoretic model
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.030openalex-snapshot
Partial Digest is hard to solve for erroneous input data
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113801openalex-snapshot
A New Dynamic Programming Algorithm for the Simplified Partial Digest Problem
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00008-9openalex-snapshot
The restriction mapping problem revisited
inferred← citeshttps://doi.org/10.1017/s0269888900000345openalex-snapshot
Current Research in Artificial Intelligence and Molecular Biology
inferred← citeshttps://doi.org/10.1038/nmeth.1350openalex-snapshot
Dereplication and de novo sequencing of nonribosomal peptides
inferred← citeshttps://doi.org/10.1051/ro:2006007openalex-snapshot
Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
inferred← citeshttps://doi.org/10.1089/cmb.1994.1.235openalex-snapshot
An Exponential Example for a Partial Digest Mapping Algorithm
inferred← citeshttps://doi.org/10.1089/cmb.1998.5.101openalex-snapshot
Expectation and Variance of True and False Fragment Matches in DNA Restriction Mapping
inferred← citeshttps://doi.org/10.1089/cmb.2004.11.1110openalex-snapshot
Sequencing from Compomers: Using Mass Spectrometry for DNA de novo Sequencing of 200+ nt
inferred← citeshttps://doi.org/10.1089/cmb.2011.0158openalex-snapshot
Multiplex De Novo Sequencing of Peptide Antibiotics
inferred← citeshttps://doi.org/10.1089/cmb.2016.0044openalex-snapshot
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
inferred← citeshttps://doi.org/10.1089/cmb.2016.0046openalex-snapshot
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
inferred← citeshttps://doi.org/10.1089/cmb.2021.0641openalex-snapshot
Fast Algorithms for the Simplified Partial Digest Problem
inferred← citeshttps://doi.org/10.1089/cmb.2024.0661openalex-snapshot
Approximate and Exact Optimization Algorithms for the Beltway and Turnpike Problems with Duplicated, Missing, Partially Labeled, and Uncertain Measurements
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.5.398openalex-snapshot
Construction of DNA restriction maps based on a simplified experiment
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.suppl_1.s253openalex-snapshot
Designing better phages
inferred← citeshttps://doi.org/10.1093/nar/24.22.4495openalex-snapshot
Mapping Genes Within a YAC by Computer-Assisted Interpretation of Partial Restriction Digestions
inferred← citeshttps://doi.org/10.1109/iwcit.2014.6842506openalex-snapshot
Phase retrieval of sparse L-ary signals from magnitudes of their Fourier transform
inferred← citeshttps://doi.org/10.1109/pdgc.2018.8745786openalex-snapshot
CPDP: A Connection based PDP Algorithm
inferred← citeshttps://doi.org/10.1109/tcbb.2007.1060openalex-snapshot
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms
inferred← citeshttps://doi.org/10.1109/tsp.2019.2931169openalex-snapshot
Super Resolution Phase Retrieval for Sparse Signals
inferred← citeshttps://doi.org/10.1109/tsp.2021.3063458openalex-snapshot
Reconstructing Point Sets From Distance Distributions
inferred← citeshttps://doi.org/10.1111/j.1541-0420.2005.00326.xopenalex-snapshot
Statistical Aspects in Physical Mapping Application to the Genome of O. oeni Strain GM
inferred← citeshttps://doi.org/10.1142/s0219720015400089openalex-snapshot
Reconstruction of sequence from its circular partial sums for cyclopeptide sequencing problem
inferred← citeshttps://doi.org/10.1504/ijbra.2013.056622openalex-snapshot
Genetic algorithm solution for partial digest problem
inferred← citeshttps://doi.org/10.17771/pucrio.acad.26566openalex-snapshot
ON THE MIN DISTANCE SUPERSET PROBLEM
inferred← citeshttps://doi.org/10.3929/ethz-a-004651579openalex-snapshot
Algorithms and hardness results for DNA physical mapping, protein identification, and related combinatorial problems
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3058openalex-snapshot
Phase Retrieval for Sparse Signals: Uniqueness Conditions
inferred← citeshttps://doi.org/10.5802/afst.1835openalex-snapshot
The distance problem on measured metric spaces
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.