Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 11
    Electronic Resource
    Electronic Resource
    Wheat specific repetitive DNA sequences — construction and characterization of four different genomic clones (1986)
    Springer
    Theoretical and applied genetics 72 (1986), S. 207-210 
    Details
    ISSN: 1432-2242
    Keywords: Repetitive DNA ; Wheat ; Rye ; Relic DNA
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Summary The construction and molecular analysis of four recombinant clones — pTa1, pTa2, pTa7, and pTa8 — is described. The four clones contain different highly repeated sequences of genomic DNA from Triticum aestivum variety ‘Chinese Spring’. The wheat specificity has been determined by colony and dot blot hybridization in comparison with total rye DNA (Secale cereale variety ‘Petka’). The four clones with a variable degree of specificity were compared by sequence analysis after the recloning of wheat DNA inserts into M13 mp8. Within the sequencing data a tendency can be observed that those repeated sequences which show the highest degree of species specificity contain a significantly increased amount of GC residues.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00266993
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    An algorithm for minimizing a differentiable function subject to box constraints and errors (1979)
    Springer
    Journal of optimization theory and applications 29 (1979), S. 521-558 
    Details
    ISSN: 1573-2878
    Keywords: Quasi-Newton algorithm ; constrained minimization ; symmetric rank-one update ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the problem of minimizing a differentiable function ofn parameters, with upper and lower bounds on the parameters. The motivation for this work comes from the optimization of the design of transient electrical circuits. In such optimization, the parameters are circuit elements, the bound constraints keep these parameters physically meaningful, and both the function and gradient evaluations contain errors. We describe a quasi-Newton algorithm for such problems. This algorithm handles the box constraints directly and approximates the given function locally by nonsingular quadratic functions. Numerical tests indicate that the algorithm can tolerate the errors, if the errors in the function and gradient are of the same relative size.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00934451
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    Some remarks on the symmetric rank-one update (1979)
    Springer
    Journal of optimization theory and applications 29 (1979), S. 493-519 
    Details
    ISSN: 1573-2878
    Keywords: Quasi-Newton formulas ; nonlinear programming ; symmetric rank-one update
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the symmetric rank-one, quasi-Newton formula. The hereditary properties of this formula do not require quasi-Newton directions of search. Therefore, this formula is easy to use in constrained optimization algorithms; no explicit projections of either the Hessian approximations or the parameter changes are required. Moreover, the entire Hessian approximation is available at each iteration for determining the direction of search, which need not be a quasi-Newton direction. Theoretical difficulties, however, exist. Even for a positive-definite, quadratic function with no constraints, it is possible that the symmetric rank-one update may not be defined at some iteration. In this paper, we first demonstrate that such failures of definition correspond to either losses of independence in the directions of search being generated or to near-singularity of the Hessian approximation being generated. We then describe a procedure that guarantees that these updates are well-defined for any nonsingular quadratic function. This procedure has been incorporated into an algorithm for minimizing a function subject to box constraints. Box constraints arise naturally in the minimization of a function with many minima or a function that is defined only in some subregion of the space.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00934450
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    Genetic heterogeneity among keto-acid-producing strains of Gluconobacter oxydans (1997)
    Springer
    World journal of microbiology and biotechnology 13 (1997), S. 289-294 
    Details
    ISSN: 1573-0972
    Keywords: Genetic heterogeneity ; genome size ; Gluconobacter oxydans ; keto-acids ; pulse-field gel electrophoresis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract The genomes of four keto-acid-producing Gluconobacter oxydans strains (ATCC9937, IFO3293, IFO12258 and DSM2343) were analysed by pulse-field gel electrophoresis (PFGE). PFGE of undigested DNA allowed the detection of plasmids in the following strains: ATCC9937 (3 plasmids; 8, 27, 31 kb), IFO3293 (9 kb), DSM2343 (21 kb). The three plasmids in ATCC9937 showed no homology to each other or to plasmids in the other strains. Seventeen restriction enzymes were tested for use in PFGE analysis of the G. oxydans strains and XbaI was chosen for restriction fragment analysis of the genomes. Fairly good resolution of restriction fragments at all size ranges was achieved by using three different pulse–time programs. The genome sizes of the four strains were estimated to be between 2240 kb and 3787 kb. The XbaI restriction patterns of the four strains showed no similarities to each other. Ten random cosmid clones of ATCC9937 were used as hybridization probes against the four strains, but, with the exception of one clone, hybridization signals were only observed with ATCC9937 itself. These data show that the four strains are not closely related.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018530923443
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...