A partial digest approach to restriction site mapping

No abstract is available for this paper.

• Publication year

  1993

• Venue

  Intelligent Systems in Molecular Biology

• Publication date

  1993-07-01

• Fields of study

  Biology, Mathematics, Computer Science, Medicine

• Identifiers
  DOI 10.1007/BF02460643PMID 7584358
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• An Exponential Example for a Partial Digest Mapping Algorithm

  1994cited by this paper
• A partial digest approach to restriction site mapping.

  1994cited by this paper
• A Lower Bound on the Number of Solutions to the Probed Partial Digest Problem

  1993cited by this paper
• Using fragment lengths from incomplete digestion by multiply cleaving enzymes to map antibody binding sites on a protein

  1992cited by this paper
• Restriction site mapping for three or more enzymes

  1990cited by this paper
• Mapping DNA by stochastic relaxation: a new approach to fragment sizes

  1990cited by this paper
• A useful elementary correlation inequality

  1989cited by this paper
• Restriction site mapping is in separation theory

  1988cited by this paper
• Errors between sites in restriction site mapping

  1988cited by this paper
• Construction of restriction maps

  1988cited by this paper
• Restriction map construction using a 'complete sentences compatibility' algorithm

  1988cited by this paper
• DNA Restriction Mapping from Random-Clone Data

  1988cited by this paper
• On the Complexity of Inverting the Autocorrelation Function of a Finite Integer Sequence, and the Problem of Locating n Points on a Line, Given the (n atop 2t) Unlabelled Distances Between Them

  1988cited by this paper
• Mapping DNA by stochastic relaxation

  1987cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper
• The Structure of Homometric Sets

  1982cited by this paper
• Inferring DNA Structures from Segmentation Data

  1978cited by this paper
• Ambiguities in the X‐ray analysis of crystal structures

  1974cited by this paper
• A Direct Method for the Determination of the Components of Interatomic Distances in Crystals

  1935cited by this paper

• A Fast and Convergent Algorithm for Unassigned Distance Geometry Problems

  2025cites this paper
• Approximate and Exact Optimization Algorithms for the Beltway and Turnpike Problems with Duplicated, Missing, Partially Labeled, and Uncertain Measurements

  2024influential citation
• Distance geometry with and without the graph

  2024cites this paper
• The distance problem on measured metric spaces

  2024cites this paper
• The beltway problem over orthogonal groups

  2024cites this paper
• A Scalable Optimization Algorithm for Solving the Beltway and Turnpike Problems with Uncertain Measurements

  2024influential citation
• On the Number of Distinct Tilings of Finite Subsets of $\mathbb{Z}^{d}$ With Tiles of Fixed Size

  2023cites this paper
• Fast Algorithms for the Simplified Partial Digest Problem

  2022cites this paper
• Robinsonian dissimilarities: a randomized analysis and extentions

  2021influential citation
• The Geometry of Musical Rhythm

  2019cites this paper
• Super Resolution Phase Retrieval for Sparse Signals

  2018cites this paper
• Reconstructing Point Sets From Distance Distributions

  2018cites this paper
• CPDP: A Connection based PDP Algorithm

  2018influential citation
• Preface: Special issue dedicated to Distance Geometry

  2018cites this paper
• CycloAnt: sequencing cyclic peptides using hybrid ants

  2017cites this paper
• A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n2 Pairwise Distances in n2 Steps for the Sequencing Problem: II. Algorithm

  2016cites this paper
• Reconstruction of sequence from its circular partial sums for cyclopeptide sequencing problem

  2015cites this paper
• Mid-labeled Partial Digest Problem

  2014cites this paper
• Phase retrieval of sparse L-ary signals from magnitudes of their Fourier transform

  2014cites this paper
• Sensing the real world - inverse problems, sparsity and sensor placement

  2014cites this paper
• Phase Retrieval for Sparse Signals: Uniqueness Conditions

  2013cites this paper
• Multiplex De Novo Sequencing of Peptide Antibiotics

  2011cites this paper
• The simplified partial digest problem: Approximation and a graph-theoretic model

  2011cites this paper
• Prolific Generation of Williamson Type Matrices

  2011cites this paper
• Computational geometric aspects of rhythm, melody, and voice-leading

  2010cites this paper
• Molecular solutions for double and partial digest problems in polynomial time

  2009cites this paper
• Reconstructing Numbers from Pairwise Function Values

  2009cites this paper
• On the approximability of the Simplified Partial Digest Problem

  2009influential citation
• De Novo Sequencing of Nonribosomal Peptides

  2008influential citation
• Sequencing from Compomers: The Puzzle

  2006cites this paper
• Distance Patterns in Structural Similarity

  2006cites this paper
• Selected combinatorial problems of computational biology

  2005cites this paper
• Combinatorial optimization in DNA mapping - a computational thread of the Simplified Partial Digest Problem

  2005cites this paper
• Partial Digest is hard to solve for erroneous input data

  2005influential citation
• Computational Geometric Aspects of Musical Rhythm

  2004cites this paper
• Algorithmic Topics in Bioinformatics : The Partial Digest Problem ( Paper for CSE 202 : Prof

  2004cites this paper
• On the complexity of the Double Digest Problem

  2004cites this paper
• Measurement Errors Make the Partial Digest Problem NP-Hard

  2004influential citation
• SEQUENCING FROM COMPOMERS : USING MASS SPECTROMETRY FOR DNA DE-NOVO SEQUENCING OF 200 + NT

  2003influential citation
• Reconstructing Sets From Interpoint Distances

  2003cites this paper
• New Algorithm for the Simplified Partial Digest Problem

  2003influential citation
• Parsing without a grammar: making sense of unknown file formats

  2003cites this paper
• Noisy Data Make the Partial Digest Problem NP-hard

  2003cites this paper
• Algorithms and hardness results for DNA physical mapping, protein identification, and related combinatorial problems

  2003cites this paper
• Sequencing from Compomers: Using Mass Spectrometry for DNA de novo Sequencing of 200+ nt

  2003cites this paper
• The restriction mapping problem revisited

  2002influential citation
• Construction of DNA restriction maps based on a simplified experiment

  2001cites this paper
• Designing better phages

  2001cites this paper
• Expectation and Variance of True and False Fragment Matches in DNA Restriction Mapping

  1998cites this paper
• Introduction to computational molecular biology

  1997cites this paper
• An algorithm for analysing probed partial digestion experiments

  1995cites this paper
• Integration of Competing Ancillary Assertions in Genome Assembly

  1994cites this paper
• An Exponential Example for a Partial Digest Mapping Algorithm

  1994cites this paper
• Finding, Evaluating, and Counting DNA Physical Maps

  1993cites this paper
• Current Research in Artificial Intelligence and Molecular Biology

  1993cites this paper
• The Simplified Partial Digest Problem: Hardness and a Probabilistic Analysis

  year unknowncites this paper
• Ieee/acm Transactions on Computational Biology and Bioinformatics 1 Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

  year unknowncites this paper
• Designing Better Phages (Extended Abstract)

  year unknowncites this paper