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-0983
    Keywords: Saccharomyces cerevisiae ; G418 resistance ; Gene cartridges ; Heterologous Gene expression
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Summary Coding sequence cartridges for aminoglycoside phosphotransferase (APT) were isolated from bacterial transposon Tn903. When incorporated into a heterologous gene construction utilising the PGK1 promoter and terminator, the heterologous APT gene provided a G418-resistance determinant that functioned efficiently as a dominant marker for yeast in both multiple- and single-copy. Transformant colonies on selective medium appeared rapidly, within 36–48 h, and growth rate of the transformed cells was normal. A simple and highly sensitive radiolabelling assay for APT enzyme activity was developed for use with crude cell protein extracts. Enzyme activity units were equated to the amount of APT protein present in the cells, and the APT protein was shown to be stable in yeast. Heterologous APT expression was 130-fold reduced compared with homologous PGK1. This resulted from an estimated two-fold decrease in mRNA level and a 65-fold decrease in translation efficiency. The latter was unaffected by AUG sequence context change, but corresponded with a high frequency of minor codons in the APT-coding sequence. APT can be used as a semi-quantitative reporter of gene expression, whose useful features are in vivo detection via the G418-resistance phenotype and powerful cell-free assay.
    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
    Machine learning 7 (1991), S. 227-252 
    ISSN: 0885-6125
    Keywords: Connectionism ; language ; induction ; dynamics ; fractals
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A higher order recurrent neural network architecture learns to recognize and generate languages after being “trained” on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the learning process illustrates a new form of mechanical inference: Induction by phase transition. A small weight adjustment canses a “bifurcation” in the limit behavior of the network. This phase transition corresponds to the onset of the network's capacity for generalizing to arbitrary-length strings. Second, a study of the automata resulting from the acquisit on of previously published training sets indicates that while the architecture is not guaranteed to find a minimal finite automaton consistent with the given exemplars, which is an NP-Hard problem, the architecture does appear capable of generating non regular languages by exploiting fractal and chaotic dynamics. I end the paper with a hypothesis relating linguistic generative capacity to the behavioral regimes of non-linear dynamical systems.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 7 (1991), S. 227-252 
    ISSN: 0885-6125
    Keywords: Connectionism ; language ; induction ; dynamics ; fractals
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A higher order recurrent neural network architecture learns to recognize and generate languages after being “trained” on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the learning process illustrates a new form of mechanical inference: Induction by phase transition. A small weight adjustment causes a “bifurcation” in the limit behavior of the network. This phase transition corresponds to the onset of the network's capacity for generalizing to arbitrary-length strings. Second, a study of the automata resulting from the acquisition of previously published training sets indicates that while the architecture is not guaranteed to find a minimal finite automaton consistent with the given exemplars, which is an NP-Hard problem, the architecture does appear capable of generating non-regular languages by exploiting fractal and chaotic dynamics. I end the paper with a hypothesis relating linguistic generative capacity to the behavioral regimes of non-linear dynamical systems.
    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...