Results 61 to 70 of about 147,371 (263)
Incidence matrices and interval graphs [PDF]
Abstract : According to present genetic theory, the fine structure of genes consists of linearly ordered elements. A mutant gene is obtained by alteration of some connected portion of this structure. By examining data obtained from suitable experiments, it can be determined whether or not the blemished portions of two mutant genes intersect or not, and
Fulkerson, D. R., Gross, O. A.
openaire +3 more sources
Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
NKCC1: A key regulator of glioblastoma progression
Glioblastoma (GBM) progression is driven by disrupted chloride cotransporter homeostasis. NKCC1 is highly expressed in stem‐like, astrocytic, and progenitor cells, correlating with earlier recurrence, while overall survival remains unaffected. NKCC1 serves as a prognostic marker and potential therapeutic target, linking chloride transporter imbalance ...
Anja Thomsen +5 more
wiley +1 more source
On $[1,2]$-Domination in Interval and Circle Graphs [PDF]
A subset $S$ of vertices in a graph $G=(V, E)$ is a Dominating Set if each vertex in $V(G)\setminus S$ is adjacent to at least one vertex in $S$. Chellali et al.
Mohsen Alambardar Meybodi +1 more
doaj +1 more source
Algorithms for optimal min hop and foremost paths in interval temporal graphs
Path problems are fundamental to the study of graphs. Temporal graphs are graphs in which the edges connecting the vertices change with time. Min hop paths problem in a temporal graph is the problem of finding time respecting paths from source vertex to ...
Anuj Jain, Sartaj K. Sahni
doaj +1 more source
Interval k-Graphs and Orders [PDF]
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes.
Brown, David E. +2 more
openaire +2 more sources
Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
A Novel Study of Graphs Based on m-Polar Cubic Structures
By combining the notions of interval-valued m-polar fuzzy graphs and m-polar fuzzy graphs, the notion of m-polar cubic graphs is first introduced. Then, the degree of a vertex in m-polar cubic graphs and complete m-polar cubic graphs is defined.
G. Muhiuddin +4 more
doaj +1 more source
Interval graphs and interval orders
This paper investigates the connection between interval graphs and interval orders, with special attention to the family of interval orders that agree with or provide representations of an interval graph. Relationships between interval graphs and interval orders that concern the number of lengths required for interval representations and bounds on ...
openaire +1 more source

