Results 71 to 80 of about 1,844,339 (310)
Development of visible light‐sensitive human neuropsin (OPN5) via single amino acid substitution
FEBS Letters, EarlyView.The present study determines a key amino acid residue, Lys91, for defining UV sensitivity of human OPN5. Heterologous action spectroscopy of the wild type and K91 mutants of OPN5 in HEK293T cells reveals that substitution of Lys91 with neutral (alanine) or acidic amino acids (glutamic or aspartic acids) causes substantial shifts in spectral sensitivity
Yusuke Sakai +2 more
wiley +1 more source
Grid Representations and the Chromatic Number [PDF]
, 2012 A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect.
Balko, Martin
core +1 more source
The Independence Number Conditions for 2-Factors of a Claw-Free Graph
Axioms, 2022 In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs.
Wanpeng Lei, Liming Xiong, Jun Yin
doaj +1 more source
FEBS Letters, EarlyView.Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile +8 more
wiley +1 more source
Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs
AKCE International Journal of Graphs and Combinatorics, 2019 The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph of size is the maximum number of odd cycles in such a cycle decomposition is and is
R. Rajarajachozhan, R. Sampathkumar
doaj +1 more source
Line graphs of directed graphs I [PDF]
Transactions on CombinatoricsWe determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +1 more source
Cell‐free DNA aneuploidy score as a dynamic early response marker in prostate cancer
Molecular Oncology, EarlyView.mFast‐SeqS‐based genome‐wide aneuploidy scores are concordant with aneuploidy scores obtained by whole genome sequencing from tumor tissue and can predict response to ARSI treatment at baseline and, at an early time point, to ARSI and taxanes. This assay can be easily performed at low cost and requires little input of cfDNA. Cell‐free circulating tumor
Khrystany T. Isebia +17 more
wiley +1 more source
Characterization of line graphs
Journal of Combinatorial Theory, 1967 AbstractLet G be a finite undirected graph with at most one edge joining a pair of vertices and no edge joining a vertex to itself. L(G) denotes the line graph of G, i.e., the vertices of L(G) are the edges of G and two vertices of L(G) are adjacent if the corresponding edges of G are adjacent. Let d(u) denote the valence of a vertex u. Let d(G) denote
openaire +3 more sources
Discrete Mathematics, 1984 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Molecular Oncology, EarlyView.Chronic TGF‐β exposure drives epithelial HCC cells from a senescent state to a TGF‐β resistant mesenchymal phenotype. This transition is characterized by the loss of Smad3‐mediated signaling, escape from senescence, enhanced invasiveness and metastatic potential, and upregulation of key resistance modulators such as MARK1 and GRM8, ultimately promoting
Minenur Kalyoncu +11 more
wiley +1 more source