Results 51 to 60 of about 588,772 (275)
Graph isomorphism completeness for trapezoid graphs
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of ...
Takaoka, Asahi
core +1 more source
The cancer problem is increasing globally with projections up to the year 2050 showing unfavourable outcomes in terms of incidence and cancer‐related deaths. The main challenges are prevention, improved therapeutics resulting in increased cure rates and enhanced health‐related quality of life.
Ulrik Ringborg +43 more
wiley +1 more source
EnGS-DGR: Traffic Flow Forecasting with Indefinite Forecasting Interval by Ensemble GCN, Seq2Seq, and Dynamic Graph Reconfiguration [PDF]
Shiyuan Han +4 more
openalex +1 more source
LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro
Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix +13 more
wiley +1 more source
Nodal domains on quantum graphs
We consider the real eigenfunctions of the Schr\"odinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds $B$.
Aurich R +25 more
core +2 more sources
Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin
The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla +10 more
wiley +1 more source
A polynomial algorithm for the k-cluster problem on interval graphs
This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well as on chordal ...
Mertzios, George B.
core +1 more source
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Weakly toll convexity and proper interval graphs [PDF]
A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \in S$
Mitre C. Dourado +3 more
doaj +1 more source
Correlation of the differential expression of PIK3R1 and its spliced variant, p55α, in pan‐cancer
PIK3R1 undergoes alternative splicing to generate the isoforms, p85α and p55α. By combining large patient datasets with laboratory experiments, we show that PIK3R1 spliced variants shape cancer behavior. While tumors lose the protective p85α isoform, p55α is overexpressed, changes linked to poorer survival and more pronounced in African American ...
Ishita Gupta +10 more
wiley +1 more source

