Filtern
Erscheinungsjahr
Dokumenttyp
- Wissenschaftlicher Artikel (36)
- Preprint (10)
- Konferenzveröffentlichung (2)
- Dissertation (1)
Sprache
- Englisch (47)
- Deutsch (1)
- Französisch (1)
Volltext vorhanden
- ja (49)
Gehört zur Bibliographie
- nein (49)
Schlagworte
- Range Concatenation Grammar (4)
- Deutsch (3)
- Syntaktische Analyse (3)
- Chronic disease (2)
- Depression (2)
- Multicomponent Tree Adjoining Grammar (2)
- Multimorbidity (2)
- Active middle ear implants (1)
- Algorithmus (1)
- Alzheimer’s dementia (1)
Institut
- Medizin (19)
- Physik (17)
- Extern (9)
- Biowissenschaften (2)
- Biochemie und Chemie (1)
- ELEMENTS (1)
- Institut für Ökologie, Evolution und Diversität (1)
- Psychologie (1)
- Senckenbergische Naturforschende Gesellschaft (1)
We analyzed a eukaryotically encoded rubredoxin from the cryptomonad Guillardia theta and identified additional domains at the N- and C-termini in comparison to known prokaryotic paralogous molecules. The cryptophytic N-terminal extension was shown to be a transit peptide for intracellular targeting of the protein to the plastid, whereas a C-terminal domain represents a membrane anchor. Rubredoxin was identified in all tested phototrophic eukaryotes. Presumably facilitated by its C-terminal extension, nucleomorph-encoded rubredoxin (nmRub) is associated with the thylakoid membrane. Association with photosystem II (PSII) was demonstrated by co-localization of nmRub and PSII membrane particles and PSII core complexes and confirmed by comparative electron paramagnetic resonance measurements. The midpoint potential of nmRub was determined as +125 mV, which is the highest redox potential of all known rubredoxins. Therefore, nmRub provides a striking example of the ability of the protein environment to tune the redox potentials of metal sites, allowing for evolutionary adaption in specific electron transport systems, as for example that coupled to the PSII pathway.
NMDA-Rezeptoren sind als ionotrope Glutamatrezeptoren (iGluRs) an der Signalübertragung durch den wichtigen Neurotransmitter L-Glutamat beteiligt. Vor allem aufgrund ihrer Bedeutung für das Phänomen der neuronalen Plastizität sind NMDA-Rezeptoren außerordentlich gründlich untersucht worden. Dennoch sind auch heute noch zentrale Fragen zu ihrer Funktionsweise ungeklärt, darunter auch diejenige, wie auf molekularer Ebene die Umsetzung der Glutamatbindung in die Öffnung des Ionenkanals erfolgt. Publizierte Kristallstrukturen der Liganden-bindungsdomänen zweier iGluRs haben die Grundlage für ein Modell der ligandeninduzierten und der Kanalöffnung vorausgehenden Vorgänge in der Bindungsdomäne geschaffen. Diesem zufolge schließt sich die aus zwei Teildomänen bestehende Bindungsdomäne venusfliegenfallenartig um den Liganden und die dabei entstehende mechanische Spannung führt zur Öffnung des Ionenkanals. Dieses Modell wurde in der vorliegenden Arbeit überprüft. Hierzu wurden verschiedene in der Ligandenbindungsdomäne punktmutierte NR1/NR2A-Rezeptoren heterolog in Säugerzellen exprimiert und durch Glutamat hervorgerufene Gesamtzellströme elektrophysiologisch gemessen. Mittels kinetischer Auswertung wurden dann Aminosäurereste in der Bindungsdomäne identifiziert, die einen Beitrag zur Kanalöffnung leisten. Die notwendige Schnelligkeit der Ligandenzugabe wurde dabei durch dessen photochemische Freisetzung aus einer maskierten und dadurch inaktiven Vorstufe (caged compound) erreicht. Die Ergebnisse bestätigen das Modell der Kopplung der Kanalöffnung an das Schließen der Bindungsdomäne und erweitern das Verständnis der genauen zeitlichen Abfolge der ligandeninduzierten Konformationsänderungen in der Bindungsdomäne. Intramolekulare Wechselwirkungen zwischen den Teildomänen S1 und S2 spielen demnach erst relativ spät im Aktivierungsprozeß eine Rolle und dienen vor allem der Stabilisierung des geschlossenen Zustandes der Bindungsdomäne und damit des offenen Ionenkanals.
This paper presents a comparative study of probabilistic treebank parsing of German, using the Negra and TüBa-D/Z treebanks. Experiments with the Stanford parser, which uses a factored PCFG and dependency model, show that, contrary to previous claims for other parsers, lexicalization of PCFG models boosts parsing performance for both treebanks. The experiments also show that there is a big difference in parsing performance, when trained on the Negra and on the TüBa-D/Z treebanks. Parser performance for the models trained on TüBa-D/Z are comparable to parsing results for English with the Stanford parser, when trained on the Penn treebank. This comparison at least suggests that German is not harder to parse than its West-Germanic neighbor language English.
In this paper, we introduce an extension of the XMG system (eXtensibleMeta-Grammar) in order to allow for the description of Multi-Component Tree Adjoining Grammars. In particular, we introduce the XMG formalism and its implementation, and show how the latter makes it possible to extend the system relatively easily to different target formalisms, thus opening the way towards multi-formalism.
How to compare treebanks
(2008)
Recent years have seen an increasing interest in developing standards for linguistic annotation, with a focus on the interoperability of the resources. This effort, however, requires a profound knowledge of the advantages and disadvantages of linguistic annotation schemes in order to avoid importing the flaws and weaknesses of existing encoding schemes into the new standards. This paper addresses the question how to compare syntactically annotated corpora and gain insights into the usefulness of specific design decisions. We present an exhaustive evaluation of two German treebanks with crucially different encoding schemes. We evaluate three different parsers trained on the two treebanks and compare results using EVALB, the Leaf-Ancestor metric, and a dependency-based evaluation. Furthermore, we present TePaCoC, a new testsuite for the evaluation of parsers on complex German grammatical constructions. The testsuite provides a well thought-out error classification, which enables us to compare parser output for parsers trained on treebanks with different encoding schemes and provides interesting insights into the impact of treebank annotation schemes on specific constructions like PP attachment or non-constituent coordination.
In this paper, we present an open-source parsing environment (Tübingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component Tree-Adjoining Grammars with Tree Tuples (TT-MCTAG)) and allows computation not only of syntactic structures, but also of the corresponding semantic representations. It is used for the development of a tree-based grammar for German.
Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues. Furthermore some languages can reveal themselves hard to describe because of specific characteristics, e.g. the free word order in German. In this context, we present (i) a framework allowing to describe tree-based grammars, and (ii) an actual fragment of a core multicomponent tree-adjoining grammar with tree tuples (TT-MCTAG) for German developed using this framework. This framework combines a metagrammar compiler and a parser based on range concatenation grammar (RCG) to respectively check the consistency and the correction of the grammar. The German grammar being developed within this framework already deals with a wide range of scrambling and extraction phenomena.
In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semantic representations.
Nous présentons ici différents algorithmes d’analyse pour grammaires à concaténation d’intervalles (Range Concatenation Grammar, RCG), dont un nouvel algorithme de type Earley, dans le paradigme de l’analyse déductive. Notre travail est motivé par l’intérêt porté récemment à ce type de grammaire, et comble un manque dans la littérature existante.
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to compute the yields of non-terminals as late as possible. Experiments show that, compared to previous approaches, the constraint propagation helps to considerably decrease the number of items in the chart.