Results 31 to 40 of about 140,549 (266)
On Independent [1, 2]-Sets in Trees
Discussiones Mathematicae Graph Theory, 2018 An [1, k]-set S in a graph G is a dominating set such that every vertex not in S has at most k neighbors in it. If the additional requirement that the set must be independent is added, the existence of such sets is not guaranteed in every graph.
Aleid Sahar A. +2 more
doaj +1 more source
, 2006 Minimal spanning forests on infinite graphs are weak limits of minimal spanning trees from finite subgraphs. These limits can be taken with free or wired boundary conditions and are denoted FMSF (free minimal spanning forest) and WMSF (wired minimal ...
Lyons, Russell +2 more
core +5 more sources
On edge disjoint spanning trees in a randomly weighted complete graph
, 2017 Assume that the edges of the complete graph $K_n$ are given independent uniform $[0,1]$ edges weights. We consider the expected minimum total weight $\mu_k$ of $k\geq 2$ edge disjoint spanning trees.
Frieze, Alan, Johansson, Tony
core +2 more sources
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
Disassortativity of random critical branching trees
, 2009 Random critical branching trees (CBTs) are generated by the multiplicative branching process, where the branching number is determined stochastically, independent of the degree of their ancestor.
Kahng, B., Kim, D., Kim, J. S.
core +1 more source
Anchored burning bijections on finite and infinite graphs [PDF]
, 2014 Let $G$ be an infinite graph such that each tree in the wired uniform spanning forest on $G$ has one end almost surely. On such graphs $G$, we give a family of continuous, measure preserving, almost one-to-one mappings from the wired spanning forest on ...
Gamlin, Samuel L., Járai, Antal A.
core +3 more sources
Meta‐analysis fails to show any correlation between protein abundance and ubiquitination changes
FEBS Open Bio, EarlyView.We analyzed over 50 published proteomics datasets to explore the relationship between protein levels and ubiquitination changes across multiple experimental conditions and biological systems. Although ubiquitination is often associated with protein degradation, our analysis shows that changes in ubiquitination do not globally correlate with changes in ...
Nerea Osinalde +3 more
wiley +1 more source
Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction [PDF]
, 2014 Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical node-register state model, with a weakly fair scheduler, and we present a space ...
Blin, Lélia, Fraigniaud, Pierre
core
, 2009 The investigations of financial markets from a complex network perspective have unveiled many phenomenological properties, in which the majority of these studies map the financial markets into one complex network.
Jiang, Zhi-Qiang +2 more
core +1 more source
Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function
FEBS Open Bio, EarlyView.We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke +4 more
wiley +1 more source