Results 51 to 60 of about 507,111 (281)

Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph

Complexity, 2020
Continuous subgraph matching problem on dynamic graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including information retrieval and community detection. Specifically, given a query graph q,
Yunhao Sun, Guanyu Li, Mengmeng Guan, Bo Ning   +3 more
doaj   +1 more source

Covering Arrays on Product Graphs [PDF]

Graphs and Combinatorics, 2017
Two vectors $x,y$ in $\mathbb{Z}_g^n$ are $ qualitatively$ $ independent$ if for all pairs $(a,b)\in \mathbb{Z}_g\times \mathbb{Z}_g$, there exists $i\in \{1,2,\ldots,n\}$ such that $(x_i,y_i)=(a,b)$. A covering array on a graph $G$, denoted by $CA(n,G,g)$, is a $|V(G)|\times n$ array on $\mathbb{Z}_g$ with the property that any two rows which ...
Akhtar, Yasmeen, Maity, Soumen
openaire   +3 more sources

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

Molecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice, Jose I. Lopez, Aitziber Ugalde‐Olano, Maite Zufiaurre, Ianire Astobiza, Natalia Martin‐Martin, Laura Bozal‐Basterra, Saioa Garcia‐Longarte, Amaia Zabala‐Letona, Sofia Rey, Aida Santos‐Martin, Miguel Unda, Ana Loizaga‐Iriarte, Mariona Graupera, Paolo Nuciforo, Arkaitz Carracedo, Isabel Mendizabal   +16 more
wiley   +1 more source

LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro

Molecular Oncology, EarlyView.
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, Daniel Samaga, Katharina Gehr, Benedek Dankó, Mohamed Schumann, Guido Drexler, Ahmed Alnatsha, Georg Beyer, Ujjwal Mahajan, Martin Selmansberger, Julia Mayerle, Claus Belka, Horst Zitzelsberger, Kirsten Lauber   +13 more
wiley   +1 more source

Trade-Offs Computing Minimum Hub Cover Toward Optimized Labeled Graph Query Processing

Online Academic Journal of Information Technology, 2018
As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization.
Hasan M. Jamil, Kerem Bülbül, Ş. İlker Birbil, Belma Yelbay   +3 more
doaj   +1 more source

On covering expander graphs by Hamilton cycles [PDF]

, 2011
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum degree $\Delta ...
Glebov, Roman, Krivelevich, Michael, Szabó, Tibor   +2 more
core  

Characteristic polynomials of graph coverings [PDF]

Bulletin of the Australian Mathematical Society, 2004
In this note, a formula for the characteristic polynomial of any (regular or irregular) graph covering is described.
Feng, RQ, Kwak, JH, Lee, J
openaire   +3 more sources

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

Molecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat, Aslihan Kucuk, Omer Erdogan, Samed Ozer, Bensu Kozan, Tugba Cuceli, Erkan Gumus, Evrim Cevik, Ozge Cevik   +8 more
wiley   +1 more source

Normal 5-edge-colorings of a family of Loupekhine snarks

AKCE International Journal of Graphs and Combinatorics, 2020
In a proper edge-coloring of a cubic graph an edge uv is called poor or rich, if the set of colors of the edges incident to u and v contains exactly three or five colors, respectively.
Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan   +2 more
doaj   +1 more source

Simplifying branched covering surface-knots by an addition of 1-handles with chart loops

, 2018
A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$. For a branched
Nakamura, Inasa
core   +1 more source