Results 101 to 110 of about 47,932 (337)
Adding modular predicates to first-order fragments
, 2015 We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which successfully covers the ...
Dartois, Luc, Paperman, Charles
core
Molecular Oncology, EarlyView.This study identifies nuclear YB‐1 S102 phosphorylation as a marker associated with KRAS and FBXW7 mutations in colorectal cancer. Mutated KRAS correlates specifically with nuclear, not cytoplasmic, S102 YB‐1. These findings provide the first ex vivo evidence of this link in CRC and suggest future studies should assess the prognostic and therapeutic ...
Konstanze Lettau +9 more
wiley +1 more source
Branch-Well-Structured Transition Systems and Extensions [PDF]
Logical Methods in Computer ScienceWe propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination.
Benedikt Bollig +2 more
doaj +1 more source
Unraveling LINE‐1 retrotransposition in head and neck squamous cell carcinoma
Molecular Oncology, EarlyView.The novel RetroTest method allows the detection of L1 activation in clinical samples with low DNA input, providing global L1 activity and the identification of the L1 source element. We applied RetroTest to a real‐world cohort of HNSCC patients where we reported an early L1 activation, with more than 60% of T1 patients showing L1 activity.
Jenifer Brea‐Iglesias +12 more
wiley +1 more source
Quantum computing architectures with signaling and control mimicking biological processes. [PDF]
Heliyon, 2023 Pau LF, Borza PN.
europepmc +1 more source
On the Theory of Structural Subtyping
, 2003 We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let $\Sigma$ be a language consisting of function symbols (representing type constructors) and $C$ a decidable structure in the relational language $L ...
Kuncak, Viktor, Rinard, Martin
core +4 more sources
Decidability in Intuitionistic Type Theory is Functionally Decidable [PDF]
Mathematical Logic Quarterly, 1996 AbstractIn this paper we show that the usual intuitionistic characterization of the decidability of the propositional function B(x) prop [x : A], i. e. to require that the predicate (∀x ∈ A) (B(x) ∨ ¬ B(x)) is provable, is equivalent, when working within the framework of Martin‐Löf's Intuitionistic Type Theory, to require that there exists a decision ...
openaire +2 more sources
EMT‐associated bias in the Parsortix® system observed with pancreatic cancer cell lines
Molecular Oncology, EarlyView.The Parsortix® system was tested for CTC enrichment using pancreatic cancer cell lines with different EMT phenotypes. Spike‐in experiments showed lower recovery of mesenchymal‐like cells. This was confirmed with an EMT‐inducible breast cancer cell line.
Nele Vandenbussche +8 more
wiley +1 more source
A SWIFT AND SIMPLE METHOD FOR DECIDING PNEUMOCOCCAL "TYPE" [PDF]
, 1931 R. R. Armstrong
openalex +1 more source
Molecular Oncology, EarlyView.Analysis of treatment‐naïve high‐grade serous ovarian carcinoma (HGSOC) and control tissues for ERVs, LINE‐1 (L1), inflammation, and immune checkpoints identified five clusters with diverse patient recurrence‐free survivals. An inflammation score was calculated and correlated with retroelement expression, where one novel cluster (Triple‐I) with high ...
Laura Glossner +6 more
wiley +1 more source