Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 29 (1979), S. 521-558 
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...