Results 291 to 300 of about 829,506 (334)

Construction of restriction maps

Bioinformatics, 1988
A computer program is described, which constructs maps of restriction endonuclease cleavage sites in linear or circular DNA molecules, given the fragment lengths in single and double digestions with two enzymes. The algorithm is based upon a partition method and a very simple rule to chain fragments. The program is written in Prolog II.
openaire   +2 more sources

Genomics via Optical Mapping II: Ordered Restriction Maps

Journal of Computational Biology, 1997
In this paper, we describe our algorithmic approach to constructing ordered restriction maps based on the data created from the images of population of individual DNA molecules (clones) digested by restriction enzymes. The goal is to devise map-making algorithms capable of producing high-resolution, high-accuracy maps rapidly and in a scalable manner ...
T S, Anantharaman, B, Mishra, D C, Schwartz   +2 more
openaire   +2 more sources

An algorithm for searching restriction maps

Bioinformatics, 1990
This paper presents an algorithm that searches a DNA restriction enzyme map for regions that approximately match a shorter 'probe' map. Both the map and the probe consist of a sequence of address-enzyme pairs denoting restriction sites, and the algorithm penalizes a potential match for undetected or missing sites and for discrepancies in the distance ...
W, Miller, J, Ostell, K E, Rudd
openaire   +2 more sources

Least-squares method for restriction mapping

Gene, 1978
A least-squares procedure has been developed to aid in deriving restriction-fragment maps once the order of cutsites has been determined. A computer program which carries out this method can be used to map either linear or circular molecules.
J L, Schroeder, F R, Blattner
openaire   +2 more sources

Improved algorithms for searching restriction maps

Bioinformatics, 1991
We present algorithms for searching a DNA restriction enzyme map for a region that best matches a shorter 'probe' map. Our algorithms utilize a new model of map alignments, and extensive experiments prove our model superior to earlier approaches for certain applications. Let M be the number of map sites and P be the number of probe sites.
W, Miller, J, Barr, K E, Rudd
openaire   +2 more sources

Refining Restriction Enzyme Genome Maps

Constraints, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Optimization of Restriction Fragment DNA Mapping

Journal of Computational Biology, 1998
Consider a mapping project in which overlap of clonal segments is inferred from complete multiple restriction digests. The fragment sizes of the clones are measured with some error, potentially leading to a map with erroneous links. The number of errors in the map depends on the number and types of enzymes used to characterize the clones.
A F, Siegel, J C, Roach, C, Magness, E, Thayer, G, van den Engh   +4 more
openaire   +2 more sources

Quasicqnformal mappings with restrictions in measure

Ukrainian Mathematical Journal, 1993
\textit{I. N. Pesin} [Dokl. Akad. Nauk SSSR 187, 740-742 (1969; Zbl 0215.128)] formulated theorems on existence, equicontinuity and completeness for classes with integral restrictions of a certain form. \textit{G. David} [Ann. Acad. Sci. Fenn., Ser. AI 13, No.
openaire   +1 more source

Global Matching of Random Restriction Maps

Methodology And Computing In Applied Probability, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Long-range restriction mapping

1995
Abstract Mapping large and complex genomes relies on techniques that permit the analysis and manipulation of long stretches of DNA, hundreds to thousands of kilobases in length. This has been achieved largely through the developments of pulsed field gel electrophoresis (PFGE)-allowing the resolution of large DNA fragments, and yeast ...
openaire   +1 more source