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-1424
    Keywords: intercellular communication ; gap junction ; connexin ; growth control ; cDNA ; connexin43 ; cell-cell channel ; junctional communication ; transformation ; cancer etiology
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Chemistry and Pharmacology
    Notes: Summary Incorporation of the gene for connexin 43, a cell-cell channel protein of gap junction, into the genome of communication-deficient transformed mouse 10T1/2 cells restored junctional communication and inhibited growth. Growth was slowed, saturation density reduced and focus formation suppressed, and these effects were contingent on overexpression of the exogenous gene and the consequent enhancement of communication. In coculture with normal cells the growth of the connexin overexpressors was completely arrested, as these cells established strong communication with the normal ones. Thus, in culture by themselves or in coculture, the connexin overexpressor cells grew like normal cells. These results demonstrate that the cell-cell channel is instrumental in growth control; they are the expected behavior if the channel transmits cytoplasmic growth-regulatory signals.
    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
    Computational optimization and applications 2 (1993), S. 145-170 
    ISSN: 1573-2894
    Keywords: global/local minimization ; simulated annealing, renormalization group ; parallel computation ; protein folding
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The search for low energy states of molecular clusters is associated with the study of molecular conformation and especially protein folding. This paper describes a new global minimization algorithm which is effective and efficient for finding low energy states and hence stable structures of molecular clusters. The algorithm combines simulated annealing with a class of effective energy functions which are transformed from the original energy function based on the theory of renormalization groups. The algorithm converges to low energy states asymptotically, and is more efficient than a general simulated annealing method.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1573-2916
    Keywords: Global/local minimization ; effective energy simulated annealing ; parallel computation ; protein folding
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This work studies the build-up method for the global minimization problem for molecular conformation, especially protein folding. The problem is hard to solve for large molecules using general minimization approaches because of the enormous amount of required computation. We therefore propose a build-up process to systematically “construct” the optimal molecular structures. A prototype algorithm is designed using the anisotropic effective energy simulated annealing method at each build-up stage. The algorithm has been implemented on the Intel iPSC/860 parallel computer, and tested with the Lennard-Jones microcluster conformation problem. The experiments showed that the algorithm was effective for relatively large test problems, and also very suitable for massively parallel computation. In particular, for the 72-atom Lennard-Jones microcluster, the algorithm found a structure whose energy is lower than any others found in previous studies.
    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...