Results 61 to 70 of about 46,607 (299)
An optimal skew-insensitive join and multi-join algorithm for distributed architecture [PDF]
The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operation in relational database systems.
Bamha, Mostafa
core +2 more sources
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
Simplicial join via tensor product [PDF]
Let \(k\) be a field, \(A\) and \(B\) finitely generated (standard graded) \(k\)-algebras, and \(M\) and \(N\) finitely generated (graded) modules over \(A\) and \(B\) respectively. In this paper, the authors prove several results of the following type, or its variances: ``\(M \bigotimes_k N\) is \({\mathcal P}\) as a \(A\bigotimes_k B\)-module if (or,
Sabzrou, Hossein +2 more
openaire +1 more source
Inositol pyrophosphates are energy‐rich signaling molecules that perform critical functions in cells. Three different families of phosphatases hydrolyze the β phosphate of the inositol pyrophosphate molecules: two have narrow specificities and one is promiscuous.
Ronda J. Rolfes
wiley +1 more source
Interleaving by Parts: Join Decompositions of Interleavings and Join-Assemblage of Geodesics [PDF]
Metrics of interest in topological data analysis (TDA) are often explicitly or implicitly in the form of an interleaving distance d(I )between poset maps (i.e. order-preserving maps), e.g.
Stefanou, Anastasios +5 more
core +1 more source
Exploring the Crossing Numbers of Three Join Products of 6-Vertex Graphs with Discrete Graphs
The significance of searching for edge crossings in graph theory lies inter alia in enhancing the clarity and readability of graph representations, which is essential for various applications such as network visualization, circuit design, and data ...
Michal Staš, Mária Švecová
doaj +1 more source
The Crossing Number of Join of the Generalized Petersen Graph P(3, 1) with Path and Cycle
There are only few results concerning the crossing numbers of join of some graphs. In this paper, the crossing numbers of join products for the generalized Petersen graph P(3, 1) with n isolated vertices as well as with the path Pn on n vertices and with
Ouyang Zhang Dong +2 more
doaj +1 more source
On Powers of Some Graph Operations [PDF]
Let G*H be the product * of G and H. In this paper we determine the rth power of the graph G*H in terms of Gr, Hrand Gr*Hr, when * is the join, Cartesian, symmetric difference, disjunctive, composition, skew and corona product. Then we solve the equation
Mohamed Seoud, Hamdy Mohamed Hafez
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source

