Results 71 to 80 of about 1,739 (253)

Automating Chemical Reasoning in High‐Throughput Phase Identification With a Probabilistic, LLM‐Guided Framework

open access: yesAdvanced Science, EarlyView.
Autonomous laboratories can now synthesize materials faster than experts can interpret the resulting diffraction data. A probabilistic framework combines refinement‐fit metrics with large language model‐derived chemical reasoning to rank competing phase interpretations and flag those unsuitable for autonomous use.
Olympia Dartsi   +7 more
wiley   +1 more source

Binarization of Synchronous Context-Free Grammars

open access: yesComputational Linguistics, 2021
Liang Huang   +3 more
doaj   +1 more source

Searching for universal model of amyloid signaling motifs using probabilistic context-free grammars. [PDF]

open access: yesBMC Bioinformatics, 2021
Dyrka W   +3 more
europepmc   +1 more source

Enhanced Antibacterial Properties of Lyotropic Liquid Crystalline Nanoparticles via Curvature Modulation

open access: yesAdvanced Science, EarlyView.
Lipid nanostructured particles with increasing negative Gaussian curvature progress from vesicles to P‐cubosomes and D‐cubosomes. This curvature hierarchy enhances interaction with bacterial membranes, promotes membrane remodeling and leakage, and potentiates daptomycin activity against MRSA.
Xiangfeng Lai   +10 more
wiley   +1 more source

Pasta, a Versatile Transcriptomic Clock, Maps the Chemical and Genetic Determinants of Aging and Rejuvenation

open access: yesAdvanced Science, EarlyView.
Pasta is a transcriptomic aging clock built on an age‐shift learning framework and trained on 17 000 samples across 21 datasets. It accurately predicts relative biological age across tissues, platforms, and species, captures stemness‐to‐senescence transitions, and identifies age‐modulatory perturbations.
Jérôme Salignon   +6 more
wiley   +1 more source

CLRe: A Synergistic Dual‐Engine Framework for One‐Step Retrosynthesis Prediction

open access: yesAdvanced Science, EarlyView.
CLRe uses a contrastive difficulty score to order pretrained seq2seq fine‐tuning for retrosynthesis. Reaction embeddings define the ranking score, and a cumulative easy‐to‐hard schedule expands from the easiest subset to the full training set while earlier examples remain active.
Tianhao Su   +5 more
wiley   +1 more source

Mepce Restrains Ferroptosis in Prostate Cancer Through 7SK–P‐TEFb Pause Control

open access: yesAdvanced Science, EarlyView.
Genome‐wide CRISPR screening identifies MEPCE as a pause‐control regulator that restrains ferroptosis in prostate cancer. MEPCE loss releases P‐TEFb/CDK9 from 7SK snRNP control, enhances RNAPII Ser2 phosphorylation, and accelerates NRF2‐HMOX1‐driven labile iron accumulation and lipid peroxidation, revealing a transcriptional kinetic gate that lowers ...
Tongtong Zhang   +9 more
wiley   +1 more source

Repurposing a Small Molecule Plant Hormone as a Tunable ON‐Switch for CAR‐T Cell Immunotherapy

open access: yesAdvanced Science, EarlyView.
By engineering a receptor system integrating the plant auxin receptor AFB1 with its co‐receptor IAA7, we enable ligand‐dependent interactions triggered by the plant hormone auxins. This design allows rapid, reversible, and dose‐dependent T cell activation, resulting in potent cytotoxicity against B‐cell lymphoma in vitro and in vivo.
Hongxiang Zeng   +16 more
wiley   +1 more source

Linguistics And Informatics, The Role Of Formal Grammar In Language Processing [PDF]

open access: yesAkofena
: This research emphasizes the role of linguistic theory in fostering an interdisciplinary domain where linguistic principles merge with informatics techniques, specifically in the field of computational linguistics.
Yakout BACHIR
doaj   +1 more source

Structural equivalence of context-free grammars

open access: yes8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 1967
AbstractTwo context-free grammars are defined as being structurally-equivalent if they generate the same sentences and assign similar parse trees (differing only in the labelling of the nodes) to each. It is argued that this type of equivalence is more significant than weak equivalence, which requires only that the same sentences be generated.
Marvin C. Paull, Stephen H. Unger
openaire   +2 more sources

Home - About - Disclaimer - Privacy