Results 51 to 60 of about 369,293 (294)
In this work, we prove the NP-completeness of two variants of tokenisation, defined here as the problem of compressing a dataset to at most 𝛿 symbols by either finding a vocabulary directly (_direct_ tokenisation), or selecting a sequence of merge operations (_bottom-up_ tokenisation).
Whittington, Philip; id_orcid0009-0005-0910-6826 +2 more
openaire +5 more sources
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
KDM7A and KDM1A inhibition suppresses tumour promoting pathways in prostate cancer
Treatment resistance is a major challenge for patients with advanced prostate cancer. This study examined an alternative approach to target the major prostate cancer‐promoting pathway by targeting epigenetic factors, whose levels are higher in tumours.
Jennie N Jeyapalan +16 more
wiley +1 more source
Negative results on acyclic improper colorings [PDF]
Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number $k$ is at most $k2^{k-1}$. We prove that this bound is tight for $k \geq 3$.
Pascal Ochem
doaj +1 more source
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
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
Stable marriage with incomplete lists and ties [PDF]
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ...
Miyazaki, S. +3 more
core +5 more sources
NP-completeness of the Eulerian walk problem for a multiple graph
In this paper, we study undirected multiple graphs of any natural multiplicity $k>1$. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of $k$ linked edges, which connect 2 or $(k+1)
Alexander V. Smirnov
doaj +1 more source
Instruction Sequence Based Non-uniform Complexity Classes [PDF]
We present an approach to non-uniform complexity in which single-pass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes.
J.A. Bergstra, C.A. Middelburg
doaj +1 more source
Splitting Number is NP-Complete
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luérbio Faria +2 more
openaire +3 more sources
Pharmacological chromatin remodeling enhances response to estrogen therapy in ER+ breast cancer
Estrogen therapy elicits clinical benefit in ~ 30% of patients with endocrine‐resistant estrogen receptor (ER)‐positive breast cancer. Based on findings that ER transcriptional activation underlies response to estrogen therapy, we tested the effects of epigenetic dysregulation via pharmacological inhibition of histone deacetylases (HDACi).
Anneka L. Johnson Thomas +16 more
wiley +1 more source

