Results 51 to 60 of about 2,196,757 (262)
Special Issue on “Graph Algorithms and Applications”
The mixture of data in real life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc.
Di Stefano, Gabriele +3 more
core +1 more source
Graph Reachability on Parallel Many-Core Architectures
Many modern applications are modeled using graphs of some kind. Given a graph, reachability, that is, discovering whether there is a path between two given nodes, is a fundamental problem as well as one of the most important steps of many other ...
Stefano Quer, Andrea Calabrese
doaj +1 more source
Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Clustering graph data: the roadmap to spectral techniques
Graph data models enable efficient storage, visualization, and analysis of highly interlinked data, by providing the benefits of horizontal scalability and high query performance.
Rahul Mondal +5 more
doaj +1 more source
AlgoDeGrafos: An Application to Assist in Course Lectures on Graph Theory
This paper describes an application of the object-oriented paradigm to the construction of AlgoDeGrafos, a graph-theoretical system enabling the use of graph algorithms.
Denis S. Silveira +2 more
doaj +1 more source
An algorithmic analysis of Flood-It and Free-Flood-It on graph powers [PDF]
Analysis of ...
Uéverton dos Santos Souza +2 more
doaj +1 more source
Breast cancer remains a major cause of cancer death in women, frequently developing endocrine therapy resistance. This study demonstrates that upregulated p21‐activated kinase 1 (PAK1) activity drives resistance to tamoxifen and long‐term estrogen deprivation in ER+ breast cancer models.
Luisa Schwarzmüller +10 more
wiley +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Capturing Topology in Graph Pattern Matching [PDF]
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source

