Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Global optimization  (2)
  • 1,5-bisphosphate carboxylase  (1)
  • 1
    ISSN: 1432-2048
    Schlagwort(e): Ribulose ; 1,5-bisphosphate carboxylase ; Gene mutation (N-terminus) ; Substrate affinity (ribulose-1,5-bisphosphate)
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie
    Notizen: Abstract Mutagenesis in vitro of the gene encoding the large subunit of ribulose-1,5-bisphosphate carboxylase/ oxygenase (EC 4.1.1.39) from Anacystis nidulans was used to generate novel enzymes. Two conserved residues, threonine 4 and lysine 11 in the N-terminus were changed. The substitution of threonine 4 with serine or valine had little effect on the kinetic parameters. The substitution of lysine 11 with leucine, which is non-polar, increased the K m for ribulose-1,5-bisphosphate from 82 to 190 μM but its replacement with glutamine, which has polar properties, had no appreciable effect.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Journal of global optimization 1 (1991), S. 173-182 
    ISSN: 1573-2916
    Schlagwort(e): Global optimization ; fractional programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Dinkelbach's global optimization approach for finding the global maximum of the fractional programming problem is discussed. Based on this idea, a modified algorithm is presented which provides both upper and lower bounds at each iteration. The convergence of the lower and upper bounds to the global maximum function value is shown to be superlinear. In addition, the special case of fractional programming when the ratio involves only linear or quadratic terms is considered. In this case, the algorithm is guaranteed to find the global maximum to within any specified tolerance, regardless of the definiteness of the quadratic form.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Journal of global optimization 5 (1994), S. 325-332 
    ISSN: 1573-2916
    Schlagwort(e): Global optimization ; stochastic methods ; deterministic methods
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract For constrained concave global minimization problems, two very different solution techniques have been investigated. The first such method is a stochastic mulitstart approach which typically finds, with high probability, all local minima for the problem. The second method is deterministic and guarantees a global minimum solution to within any user specified tolerance. It is the purpose of this paper to make a careful comparison of these two methods on a range of test problems using separable concave objectives over compact polyhedral sets, and to investigate in this way the advantages and disadvantages of each method. A direct computational comparison, on the same set of over 140 problems, is presented.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...