Results 71 to 80 of about 697,927 (279)
Molecular Oncology, EarlyView.Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
Commutative Languages and their Composition by Consensual Methods [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time NLOG-SPACE multi-counter machines. We show that unions and concatenations of such languages can be similarly recognized, relying on – and further ...
Stefano Crespi Reghizzi +1 more
doaj +1 more source
Regularity of splicing languages
Discrete Applied Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
Nuclear pore links Fob1‐dependent rDNA damage relocation to lifespan control
FEBS Open Bio, EarlyView.Damaged rDNA accumulates at a specific perinuclear interface that couples nucleolar escape with nuclear envelope association. Nuclear pores at this site help inhibit Fob1‐induced rDNA instability. This spatial organization of damage handling supports a functional link between nuclear architecture, rDNA stability, and replicative lifespan in yeast.
Yamato Okada +5 more
wiley +1 more source
Non-termination using Regular Languages [PDF]
, 2014 We describe a method for proving non-looping non-termination, that is, of term rewriting systems that do not admit looping reductions. As certificates of non-termination, we employ regular (tree) automata.Comment: Published at International Workshop on ...
Endrullis, Jörg, Zantema, Hans
core +1 more source
Quotient Complexities of Atoms of Regular Languages
, 2012 An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection.
Brzozowski, Janusz, Tamm, Hellis
core +1 more source
Regular tree languages in low levels of the Wadge Hierarchy [PDF]
Logical Methods in Computer Science, 2019 In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk +3 more
doaj +1 more source
Development of human monoclonal antibodies against TARM1 by yeast display
FEBS Open Bio, EarlyView.Human monoclonal antibodies against TARM1 are generated by yeast display‐guided selection. These antibodies bind to soluble and cell‐surface forms of TARM1. Also, these antibodies exhibit agonistic activity in the NFAT‐GFP reporter assay, indicating that TARM1 signaling can be functionally modulated by antibodies and suggesting TARM1 as a potential ...
Rikio Yabe +5 more
wiley +1 more source
Regular component decomposition of regular languages
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources