Results 61 to 70 of about 652,005 (320)
European Journal of Combinatorics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
Complement of the generalized total graph of fields
AKCE International Journal of Graphs and Combinatorics, 2020 Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
doaj +1 more source
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Ural Mathematical Journal, 2020 Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +1 more source
Seidel Integral Complete Split Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation on regular graphs.
Pavel Hic +2 more
doaj +1 more source
On the Enumeration of Minimal Dominating Sets and Related Notions
, 2014 A dominating set $D$ in a graph is a subset of its vertex set such that each vertex is either in $D$ or has a neighbour in $D$. In this paper, we are interested in the enumeration of (inclusion-wise) minimal dominating sets in graphs, called the Dom-Enum
Kanté, Mamadou Moustapha +3 more
core +3 more sources
Molecular Oncology, EarlyView.PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham +21 more
wiley +1 more source
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source