Results 91 to 100 of about 390,323 (304)
On the independence number of random graphs
Discrete Mathematics, 1990 The independence number (the largest number of vertices not joined by any edges) is considered for a Bernoulli graph of order n with edge probability \(p=0(1)\). A result concerning convergence in probability is proved by using a martingale inequality.
openaire +2 more sources
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Efficient algorithms for conditional independence inference
, 2010 The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transform (sets of) CI statements into certain integral vectors and to verify by a ...
Studený, Milan +3 more
core
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
MathematicsIn this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj +1 more source
FEBS Letters, EarlyView.Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura +2 more
wiley +1 more source
On the number of maximum independent sets of graphs [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum
Tajedin Derikvand, Mohammad Reza Oboudi
doaj
On the independence number of graph powers
Computational and Applied MathematicsAbstract Let G be a simple connected graph, and k be a positive integer. The k th graph power $$G^k$$
Rosário Fernandes, Rúben Palma
openaire +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Do We Really Need Central Bank Independence? A Critical Re- examination [PDF]
In this survey, we critically review the argument for central bank independence (CBI). We argue CBI is neither necessary nor sufficient for reaching monetary stability.
Carsten Hefeker, Bernd Hayo
core
On the Number of Successes in Independent Trials
The Annals of Mathematical Statistics, 1965 The distribution of the number of successes in independent trials is shown to be bell-shaped of every order. The most likely number of successes is "almost uniquely" determined from the mean number and from the mean plus the largest and smallest probability of success on any trial.
openaire +3 more sources