Results 61 to 70 of about 848,049 (294)
A simple rule of thumb for the explanation of d-orbital splitting in complexes
Educación Química, 2020 In chemistry at pre-university level and freshman engineering (non-chemistry discipline) classrooms at universities in India, the splitting of the energy levels of d-orbitals in complexes is an important concept to be learnt, but is not explicitly ...
Sanjeev Rachuru +2 more
doaj +1 more source
Constructing benchmark test sets for biological sequence analysis using independent set algorithms.
PLoS Computational Biology, 2022 Biological sequence families contain many sequences that are very similar to each other because they are related by evolution, so the strategy for splitting data into separate training and test sets is a nontrivial choice in benchmarking sequence ...
Samantha Petti, Sean R Eddy
doaj +1 more source
Contracting Graphs to Split Graphs and Threshold Graphs
CoRR, 2013 14 pages, 4 ...
Leizhen Cai, Chengwei Guo
openaire +3 more sources
On the Planar Split Thickness of Graphs [PDF]
Algorithmica, 2016 Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation substitutes a vertex $v$ by at most $k$ new vertices such that each neighbor of $v$ is connected to at least one of the new
David Eppstein +9 more
openaire +7 more sources
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Matrix partitions of split graphs
Discrete Applied Mathematics, 2014 Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split graphs. Previously such a result was only known for the class of cographs.
Tomás Feder, Pavol Hell, Oren Shklarsky
openaire +2 more sources
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
FEBS Open Bio, EarlyView.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
Retractions of split graphs and End-orthodox split graphs
Discrete Mathematics, 2002 A finite graph \(\Gamma\) is said to be split if its vertex set can be partitioned into two subsets \(K\) and \(I\), so that every pair of vertices of \(K\) is joined by an edge of \(\Gamma\), and no two vertices of \(I\) are. A monoid \(M\) is called regular if, given any \(a\in M\), there is an element \(b \in M\) so that \(aba=a\), and a regular ...
openaire +2 more sources
Degree distance based topological indices of some graph transforms
, 2022 A topological index is invariantly used to study the structure of molecular graph. In this paper, we have generalized degree distance index, Gutman index and reciprocal degree distance index, and calculate generalized indices for splitting and co ...
Patil, Shobha +12 more
core +1 more source
FEBS Open Bio, EarlyView.Repair of neuronal DNA damage in Alzheimer's disease by KCL‐286. (A) Amyloid‐β oligomers and plaques impair neuronal DNA repair pathways, leading to DNA double‐strand breaks and glial activation. (B) KCL‐286 activates RARβ/RXR signalling via retinoic acid response elements (RAREs), associated with increased BRCA1 expression, enhanced DNA repair and ...
Natasha Hill +6 more
wiley +1 more source