Results 51 to 60 of about 131,879,682 (302)
A teaching and support tool for building formal models of graphical user-interfaces [PDF]
, 1995 In this paper we propose the design of a tool that will allow the construction of a formal, textual description of a software system even if it has a graphical user-interface as a component.
Reeves, Steve
core +1 more source
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
Molecular Oncology, EarlyView.IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis +3 more
wiley +1 more source
Undecidable First-Order Theories of Affine Geometries [PDF]
Logical Methods in Computer Science, 2013 Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv.
Antti Kuusisto +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
Some observations on the logical foundations of inductive theorem proving [PDF]
Logical Methods in Computer Science, 2018 In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a goal. Based on
Stefan Hetzl, Tin Lok Wong
doaj +1 more source
Mathematical Logic in Computer Science
CoRR, 2018 The article retraces major events and milestones in the mutual influences between mathematical logic and computer science since the 1950s.
openaire +4 more sources
Molecular Oncology, EarlyView.Arginine methylation can be viewed as a persistence‐prone post‐translational modification regulated by a network of PRMTs. Competitive and compensatory interactions among PRMTs can redistribute methylation across substrate pools shaped by sequence, structural, spatial, and environmental layers, reinforcing RNA‐processing, chromatin, and signaling ...
So Hyun Kwon, Ji Min Lee
wiley +1 more source
A Galois connection between Turing jumps and limits [PDF]
Logical Methods in Computer Science, 2018 Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this another problem that
Vasco Brattka
doaj +1 more source
Directed evolution of enzymes at the crossroads of tradition and innovation
FEBS Open Bio, EarlyView.An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semantics [PDF]
Logical Methods in Computer Science, 2017 In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a
Karim Nour, Mohamad Ziadeh
doaj +1 more source