Results 131 to 140 of about 4,129,862 (348)
Tumour‐proximal deep serum proteomics identifies biomarkers associated with ovarian cancer
New biomarkers are needed for early ovarian cancer detection. Ovarian (tumour‐proximal) and peripheral vein serum from healthy women and patients with benign or malignant tumours underwent nanoparticle‐enriched deep proteomics. Ovarian serum yielded more protein identifications and revealed tumour‐reflective signatures.
Darren Lau +9 more
wiley +1 more source
Cisplatin‐resistant cancer cells survive DNA‐damaging platinum‐based treatment yet remain sensitive to CuET‐induced proteotoxic stress. The distinct mechanism of action allows CuET to overcome and eliminate cisplatin‐resistant tumour cells, unless highly expressed metallothioneins (MTs) interfere with CuET, thereby highlighting MT levels as candidate ...
Stefanos Arampatzis +20 more
wiley +1 more source
Proof of a conjecture on edge coloring of the Kneser graph K(t, 2) [PDF]
L. Panneerselvam +3 more
doaj +1 more source
Construction of Cospectral Integral Regular Graphs
Graphs G and H are called cospectral if they have the same characteristic polynomial. If eigenvalues are integral, then corresponding graphs are called integral graph.
Bapat Ravindra B., Karimi Masoud
doaj +1 more source
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee +3 more
wiley +1 more source
A construction for regular-graph designs [PDF]
A regular-graph design is a block design for which a pair $\{a,b\}$ of distinct points occurs in $λ+1$ or $λ$ blocks depending on whether $\{a,b\}$ is or is not an edge of a given $δ$-regular graph. Our paper describes a specific construction for regular-
Rutherford, Carrie, Forbes, Anthony
core +4 more sources
The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$ [PDF]
The existence of $srg(99,14,1,2)$ has been a question of interest for several decades to the moment. In this paper, we consider the structural properties in general for the family of strongly regular graphs with parameters $\lambda =1$ and $\mu =2$.
Reimbay Reimbayev
doaj +1 more source
Spectral Characterization of the Hamming Graphs [PDF]
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Maximum Hypergraphs without Regular Subgraphs
We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2n−1+r−2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2n−1 ...
Kim Jaehoon, Kostochka Alexandr V.
doaj +1 more source

