Results 311 to 320 of about 998,947 (335)
Some of the next articles are maybe not open access.
Plasmid, 1983
Tn7, a transposon of 14 kb, encodes resistance to trimethoprim (Tp) and streptomycin (Sm). A cleavage site map of this transposon for twenty-two different restriction enzymes as determined by comparison of restriction enzyme cleavage patterns of the plasmids ColE1 and ColE1::Tn7 is presented.
Gosti-Testu, Françoise +2 more
openaire +4 more sources
Tn7, a transposon of 14 kb, encodes resistance to trimethoprim (Tp) and streptomycin (Sm). A cleavage site map of this transposon for twenty-two different restriction enzymes as determined by comparison of restriction enzyme cleavage patterns of the plasmids ColE1 and ColE1::Tn7 is presented.
Gosti-Testu, Françoise +2 more
openaire +4 more sources
An algorithm for searching restriction maps
Bioinformatics, 1990This 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 ...
Kenneth E. Rudd +2 more
openaire +3 more sources
Modelling errors in restriction mapping [PDF]
[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences, 2002 Restriction mapping is a process by which sites along an unsequenced DNA molecule are located through measurement of the distance between them. The authors consider a model for handling errors in restriction maps in which the error in measurement is modeled by using a normal distribution.
Trevor I. Dix +2 more
openaire +1 more source
Construction of restriction maps
Bioinformatics, 1988A 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 +3 more sources
2022
This thesis was scanned from the print manuscript for digital preservation and is copyright the author. Researchers can access this thesis by asking their local university, institution or public library to make a request on their behalf. Monash staff and postgraduate students can use the link in the References field.
openaire +1 more source
This thesis was scanned from the print manuscript for digital preservation and is copyright the author. Researchers can access this thesis by asking their local university, institution or public library to make a request on their behalf. Monash staff and postgraduate students can use the link in the References field.
openaire +1 more source
On the limitations of automated restriction mapping
Bioinformatics, 1994Eight important restriction mapping programs, developed between 1978 and 1993, are analyzed and their performance evaluated. The analyses concentrate on the practical value of the programs to molecular biologists who do restriction mapping on a daily basis, rather than on theoretical efficiency.
Peter C. Nelson, James A. Inglehart
openaire +2 more sources
Arabidopsis YAC restriction mapping
Genome, 1998The approach of partial restriction mapping and vector hybridisation has been used to restriction map and align six yeast artificial chromosomes (YACs) corresponding to the top arm (~27.9 centiMorgans, cM) of Arabidopsis chromosome 5 and confirm the chimeric nature of a further four clones which map to this region.
Shaun Morroll, Zoe A. Wilson
openaire +3 more sources
Random Mappings with Restricted Preimages [PDF]
, 2012 In this paper we refer to finite endofunctions where each image has at most r preimages as r-mappings. Probabilistic analysis of these mappings provides heuristics for problems arising in cryptography which involve similar but more complicated classes of mappings.
Andrew MacFie, Daniel Panario
openaire +1 more source
Restriction site mapping is in separation theory
Bioinformatics, 1988A computer algorithm for restriction-site mapping consists of a generator of partial maps and a consistency checker. This paper examines consistency checking and argues that a method based on separation theory extracts the maximum amount of information from fragment lengths in digest data. It results in the minimum number of false maps being generated.
Chut N. Yee, Lloyd Allison
openaire +3 more sources
Quasicqnformal mappings with restrictions in measure
Ukrainian Mathematical Journal, 1993The principal result of the paper is a criterion of compactness for mappings quasiconformal in the mean. The semicontinuity of a deformation of homeomorphisms from the Sobolev class is also proved.
openaire +2 more sources