Results 21 to 30 of about 557 (235)
A polynomial-time parsing algorithm for TT-MCTAG [PDF]
, 2009 This paper investigates the class of Tree-Tuple MCTAG with Shared Nodes, TT-MCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language processing, in particular for dealing with discontinuities and word order ...
KALLMEYER L +4 more
core +1 more source
Accepting grammars and systems [PDF]
, 2007 We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited ...
Bordihn, Henning, Fernau, Henning
core +2 more sources
Generation of Two-Dimensional Grammar Based Pattern Languages using Array Rewriting P System
International Journal of Innovative Technology and Exploring Engineering, 2019 The theory of membrane computing was formulated by Paun as an attempt to formulate a computational model inspired by the way in which the living cells function. P systems which is a highly distributed, parallel, theoretical model and is an area of special interest in recent times.
Christopher Kezia Parimalam* +1 more
openaire +2 more sources
Programming errors in traversal programs over structured data [PDF]
, 2013 Traversal strategies à la Stratego (also à la Strafunski and ‘Scrap Your Boilerplate’) provide an exceptionally versatile and uniform means of querying and transforming deeply nested and heterogeneously structured data including terms in functional ...
Kaiser, Markus +5 more
core +1 more source
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars [PDF]
, 2001 The type of a minimalist grammar (MG) as introduced by Stabler [11,12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism.
openaire +2 more sources
Prefix probabilities for linear context-free rewriting systems [PDF]
, 2011 We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and
Satta, Giorgio +2 more
core
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Molecular Oncology, EarlyView.LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang +9 more
wiley +1 more source
A Syntactic Approach to Macro-Grammars for Context-Free Languages [PDF]
, 2009 We commence this thesis by setting a backdrop for the work. In [HN05] Herranz and Nogueira introduced the MTP (More Than Parsing) tool. They designed MTP to be an automatic parser generator.
Nuche Bascón, Jaime
core +1 more source
Rapid screening of staphylokinase protein variants using an unpurified cell‐free expression system
FEBS Open Bio, EarlyView.An unpurified cell‐free protein synthesis (CFPS) platform enables rapid functional screening of staphylokinase variants. Direct plasminogen‐activation assays performed in microplate format provide real‐time activity readouts, allowing rapid identification and ranking of variants with improved or reduced fibrinolytic activity without protein ...
Maria Tomková +3 more
wiley +1 more source