Results 61 to 70 of about 156,901 (262)
Molecular Oncology, EarlyView.We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
Complexity of Null- and Positivstellensatz proofs
Annals of Pure and Applied Logic, 2001 We introduce two versions of proof systems dealing with systems of inequalities: Positivstellensatz refutations and Positivstellensatz calculus. For both systems we prove the lower bounds on degrees and lengths of derivations for the example due to Lazard, Mora and Philippon.
Dima Grigoriev, Nicolai N. Vorobjov Jr.
openaire +4 more sources
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Molecular Oncology, EarlyView.Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source
Empirically comparing the performance of blockchain's consensus algorithms
IET Blockchain, 2021 Blockchain‐based audit systems suffer from low scalability and high message complexity. The root cause of these shortcomings is the use of “Practical Byzantine Fault Tolerance” (PBFT) consensus protocol in those systems.
Ashar Ahmad +5 more
doaj +1 more source
Liquid biopsy‐based diagnostic evaluation of hypermethylated CpG sites for ovarian cancer diagnosis
Molecular Oncology, EarlyView.This schematic outlines the workflow from biomarker identification to duplex MethyLight assay validation for epithelial ovarian cancer diagnosis using cfDNA‐based liquid biopsy. Initial screening of hypermethylated CpG candidates (cg02957270, cg10061138 cg00480298, COL2A1) was performed in tissue using ARMS‐PCR, COBRA, qPCR and image analysis. Selected
Deepa Bisht +3 more
wiley +1 more source
The proof complexity of linear algebra
Annals of Pure and Applied Logic, 2003 The authors analyze the complexity of the concepts needed to prove the basic theorems of linear algebra. One of the important results obtained in this paper is that the Cayley-Hamilton theorem enjoys a feasible proof. The analysis is carried out by making use of three formal theories, each of which is carefully designed so as to examine the basic ...
Michael Soltys, Stephen A. Cook
openaire +1 more source
A sharp threshold in proof complexity [PDF]
Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001 We give the first example of a sharp threshold in proof complexity. More precisely, we show that for any sufficiently small e>0 and Δ>2.28, random formulas consisting of (1-e)n 2-clauses and &Dgr n 3-clauses, which are known to be unsatisfiable almost certainly, almost certainly require resolution and Davis-Putnam proofs of unsatisfiability of ...
Dimitris Achlioptas +2 more
openaire +1 more source
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Molecular Oncology, EarlyView.Drug resistance limits treatment success in a subset of lung cancers driven by ROS1 gene alterations. Using patient‐derived cells and computer simulations, we studied three key mutations and how they affect five targeted drugs. The mutations reduced drug effectiveness in different ways by altering protein structure and behavior.
Farhan Ul Haq +8 more
wiley +1 more source
Vietnam Journal of Computer ScienceAs the complexity of software systems is ever increasing, so is the need for practical tools for formal verification. Among these are automatic theorem provers, capable of solving various reasoning problems automatically, and proof assistants, capable of
Simon Tobias Lund, Jørgen Villadsen
doaj +1 more source