Results 131 to 140 of about 475,794 (375)

On algorithmic decidability of the square-free word problem relative to a system of two defining relations [PDF]

arXiv, 2012
The square-free word problem relative to a system of two defining relations is decidable.
arxiv  

Molecular and functional profiling unravels targetable vulnerabilities in colorectal cancer

Molecular Oncology, EarlyView.
We used whole exome and RNA‐sequencing to profile divergent genomic and transcriptomic landscapes of microsatellite stable (MSS) and microsatellite instable (MSI) colorectal cancer. Alterations were classified using a computational score for integrative cancer variant annotation and prioritization.
Efstathios‐Iason Vlachavas, Konstantinos Voutetakis, Vivian Kosmidou, Spyridon Tsikalakis, Spyridon Roditis, Konstantinos Pateas, Ryangguk Kim, Kymberleigh Pagel, Stephan Wolf, Gregor Warsow, Antonia Dimitrakopoulou‐Strauss, Georgios N. Zografos, Alexander Pintzas, Johannes Betge, Olga Papadodima, Stefan Wiemann   +15 more
wiley   +1 more source

Deciding the Chromatic Numbers of Algebraic Hypergrahs [PDF]

arXiv, 2016
For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.
arxiv  

Multiplex single‐cell profiling of putative cancer stem cell markers ALDH1, SOX9, SOX2, CD44, CD133 and CD15 in endometrial cancer

Molecular Oncology, EarlyView.
Cancer stem cells are associated with aggressive disease, but a deep characterization of such markers is lacking in endometrial cancer. This study uses imaging mass cytometry to explore putative cancer stem cell markers in endometrial tumors and corresponding organoid models.
Hilde E. Lien, Marta E. Hjelmeland, Hege F. Berg, Rose M. Gold, Kathrine Woie, Lars A. Akslen, Ingfrid S. Haldorsen, Camilla Krakstad   +7 more
wiley   +1 more source

Branch-Well-Structured Transition Systems and Extensions [PDF]

Logical Methods in Computer Science
We propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination.
Benedikt Bollig, Alain Finkel, Amrita Suresh   +2 more
doaj   +1 more source

Decidable varieties of p-algebras [PDF]

arXiv
We show that for quasivarieties of p-algebras the properties of (i) having decidable first-order theory and (ii) having decidable first-order theory of the finite members, coincide. The only two quasivarieties with these properties are the trivial variety and the variety of Boolean algebras.
arxiv  

Stochastic variation in the FOXM1 transcription program mediates replication stress tolerance

Molecular Oncology, EarlyView.
Cellular heterogeneity is a major cause of drug resistance in cancer. Segeren et al. used single‐cell transcriptomics to investigate gene expression events that correlate with sensitivity to the DNA‐damaging drugs gemcitabine and prexasertib. They show that dampened expression of transcription factor FOXM1 and its target genes protected cells against ...
Hendrika A. Segeren, Kathryn A. Wierenga, Frank M. Riemers, Elsbeth A. van Liere, Bart Westendorp   +4 more
wiley   +1 more source

Federated Learning in Computational Toxicology: An Industrial Perspective on the Effiris Hackathon. [PDF]

Chem Res Toxicol, 2023
Bassani D, Brigo A, Andrews-Morger A.
europepmc   +1 more source

Decidability of Second-Order Theories and Automata on Infinite Trees [PDF]

, 1969
Michael O. Rabin
openalex   +1 more source

A variety with solvable, but not uniformly solvable, word problem [PDF]

Proc. London Math. Soc. 66 (1993), 225-256, 1993
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the ...
arxiv