Results 91 to 100 of about 96,525 (309)
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
The k-conversion number of regular graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph and a set an irreversible k -threshold conversion process on G is an iterative process wherein, for each St is obtained from by adjoining all vertices that have at least k neighbors in We call the set S0 the seed set of the process, and ...
Christina M. Mynhardt, Jane L. Wodlinger
doaj +1 more source
Finding planted partitions in random graphs with general degree distributions [PDF]
, 2009 We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin, Lanka, André
core +1 more source
Molecular Oncology, EarlyView.Radiotherapy (RT) response depends on the DNA repair capacity of tumor and host cells. We show that circulating tumor cell (CTC) counts and apoptosis rates before and after RT predict treatment response and outcome, which can be accessed via easily accessible liquid biopsy approaches. Created in BioRender. Wikman, H.
Yvonne Goy +10 more
wiley +1 more source
Regular graphs with four eigenvalues
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core +2 more sources
Domination in 4-regular Knödel graphs
Open Mathematics, 2018 A subset D of vertices of a graph G is a dominating set if for each u ∈ V(G) ∖ D, u is adjacent to some vertex v ∈ D. The domination number, γ(G) of G, is the minimum cardinality of a dominating set of G.
Mojdeh Doost Ali, Musawi S.R., Nazari E.
doaj +1 more source
The reflexive edge strength on some almost regular graphs. [PDF]
Heliyon, 2021 Agustin IH +4 more
europepmc +1 more source
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
Handicap Labelings of 4-Regular Graphs
Advances in Electrical and Electronic Engineering, 2017 Let G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same
Petr Kovar +3 more
doaj +1 more source
Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs. [PDF]
J Math Biol, 2021 Richter H.
europepmc +1 more source