Results 91 to 100 of about 786,749 (367)
This article advocates integrating temporal dynamics into cancer research. Rather than relying on static snapshots, researchers should increasingly consider adopting dynamic methods—such as live imaging, temporal omics, and liquid biopsies—to track how tumors evolve over time.
Gautier Follain+3 more
wiley +1 more source
The -annihilating-ideal hypergraph of commutative ring
The concept of the annihilating-ideal graph of a commutative ring was introduced by Behboodi et. al in 2011. In this paper, we extend this concept to the hypergraph for which we define an algebraic structure called -annihilating-ideal of a commutative ...
K. Selvakumar, V. Ramanathan
doaj +1 more source
An SPQR-Tree-Like Embedding Representation for Level Planarity [PDF]
An SPQR-tree is a data structure that efficiently represents all planar embeddings of a biconnected planar graph. It is a key tool in a number of constrained planarity testing algorithms, which seek a planar embedding of a graph subject to some given set of constraints.
arxiv
Planar Prior Assisted PatchMatch Multi-View Stereo [PDF]
The completeness of 3D models is still a challenging problem in multi-view stereo (MVS) due to the unreliable photometric consistency in low-textured areas.
Qingshan Xu, Wenbing Tao
semanticscholar +1 more source
HDAC4 regulates apoptosis in Acan‐CreERT2;HDAC4d/d mice with osteoarthritis by downregulating ATF4
Using the AcanCreERT2;HDAC4fl/fl genetic mouse model, we further investigated the role of histone deacetylase 4 (HDAC4) in chondrocyte apoptosis. We found that knocking down HDAC4 may be associated with chondrocyte apoptosis by upregulating the activating transcription factor 4 (ATF4)/CAAT/enhancer binding protein homologous (CHOP) signaling pathway ...
Jingrui Huang+11 more
wiley +1 more source
AbstractA set S of vertices in a digraph D=(V,A) is a kernel if S is independent and every vertex in V-S has an out-neighbor in S. We show that there exist O(n219.1k+n4)-time and O(k36+219.1kk9+n2)-time algorithms for checking whether a planar digraph D of order n has a kernel with at most k vertices.
Gutin, Gregory+3 more
openaire +7 more sources
Non-planar extensions of subdivisions of planar graphs [PDF]
This version fixes an error in the published paper. The error was kindly pointed out to us by Katherine Naismith. Changes from the published version are indicated in red.
Robin Thomas, Sergey Norin
openaire +3 more sources
The Continuum Between Hexagonal Planar and Trigonal Planar Geometries
New heterometallic hydride complexes that involve the addition of {Mg–H} and {Zn–H} bonds to group 10 transition metals (Pd, Pt) are reported. The side-on coordination of a single {Mg–H} to Pd forms a well-defined σ-complex. In contrast, addition of three {Mg–H} or {Zn–H} bonds to Pd or Pt results in the formation of planar complexes with subtly ...
Martí Garçon+7 more
openaire +4 more sources
Identification of inhibitors of the Salmonella FraB deglycase, a drug target
A high‐throughput screen was used to identify inhibitors of Salmonella FraB, a drug target. Characterization of top hits (identified after an additional counter screen) revealed that some triazolidines, thiadiazolidines, and triazolothiadiazoles are mixed‐type inhibitors of FraB.
Jamison D. Law+6 more
wiley +1 more source
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs [PDF]
AbstractLet G be an embedded planar digraph. A maximum upward planar subgraph of G is an embedding preserving subgraph that is upward planar and, among those, has the maximum number of edges. This paper presents an extensive study on the problem of computing maximum upward planar subgraphs of embedded planar digraphs: Complexity results, algorithms ...
BINUCCI, Carla+2 more
openaire +4 more sources