Results 21 to 30 of about 564 (166)

New polynomial delay bounds for maximal subgraph enumeration by proximity search [PDF]

, 2019
In this paper we propose polynomial delay algorithms for several maximal subgraph listing problems, by means of a seemingly novel technique which we call proximity search.
Conte A., Takeaki Uno, Uno T., Alessio Conte   +3 more
core   +1 more source

Tight Distributed Listing of Cliques

, 2020
Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGEST model of distributed computing. However, so far, very few tight bounds are known in this area.
François Le Gall, Chang, Yi-Jun, Yi-Jun Chang, Leitersdorf, Dean, Dean Leitersdorf, Keren Censor-Hillel, Censor-Hillel, Keren, Gall, François Le   +7 more
core   +1 more source

Diffusion‐Based Generative Model With Scaffold‐Hopping Strategy Yields Highly Potent Bioactive Molecules

Advanced Science, EarlyView.
SMarT‐Diff introduces a multi‐objective generative paradigm that integrates scaffold hopping with structure‐aware scoring to enable controlled exploration beyond the training distribution. The framework consistently balances drug‐likeness, synthesizes accessibility and bioactivity, yielding chemically diverse candidates with enhanced properties.
Yuwei Yang, Xiaoqing Gong, Shukai Gu, Jing Li, Bo Liu, Yanan Tian, Qianqian Zhang, Xiaojun Yao, Huanxiang Liu   +8 more
wiley   +1 more source

Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction

Advanced Science, EarlyView.
We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen, Guancen Lin, Chuan‐Shen Hu, Yong Wang   +3 more
wiley   +1 more source

Listing Subgraphs by Cartesian Decomposition.

, 2018
We investigate a decomposition technique for listing problems in graphs and set systems. It is based on the Cartesian product of some iterators, which list the solutions of simpler problems. Our ideas applies to several problems, and we illustrate one of them in depth, namely, listing all minimum spanning trees of a weighted graph G.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari   +4 more
openaire   +5 more sources

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs [PDF]

CoRR
We show that, for every fixed positive integers $r$ and $k$, \textsc{Max-Weight List $r$-Colorable Induced Subgraph} admits a polynomial-time algorithm on $kP_3$-free graphs. This problem is a common generalization of \textsc{Max-Weight Independent Set}, \textsc{Odd Cycle Transversal} and \textsc{List $r$-Coloring}, among others. Our result has several
Galby, Esther, Lima, Paloma T., Munaro, Andrea, Nikabadi, Amir; id_orcid 0009-0002-1446-1935   +3 more
openaire   +2 more sources

Accelerating Primary Screening of USP8 Inhibitors from Drug Repurposing Databases with Tree‐Based Machine Learning

Advanced Intelligent Discovery, EarlyView.
This study introduces a tree‐based machine learning approach to accelerate USP8 inhibitor discovery. The best‐performing model identified 100 high‐confidence repurposable compounds, half already approved or in clinical trials, and uncovered novel scaffolds not previously studied. These findings offer a solid foundation for rapid experimental follow‐up,
Yik Kwong Ng, Sharon Ai Er Lam, Wei Chun Lim, Hannah Hui Min Toh, Shi Jun Ang   +4 more
wiley   +1 more source

Implantation‐On‐Chip: An AI‐Based Platform for Monitoring the Embryo Trophoblast–Endometrial Stroma Cross Talk With Xenobiotics Interference

Advanced Intelligent Systems, EarlyView.
We present a novel AI‐integrated implantation‐on‐chip platform that enables mimicking and monitoring the maternal–fetal interactions at the early phases of human embryo implantation with high spatiotemporal resolution. The complexity of the trophoblast invasion process was addressed by conducting the analysis at global (rate of invasion) and local ...
Joanna Filippi, Valentina Lacconi, Arianna Mencattini, Micol Massimiani, Dolores Lobresca, Gaia Posanzini, Alessia Riccardi, Paola Casti, Michele D’Orazio, Gianni Antonelli, Giorgia Curci, Luisa Campagnolo, Eugenio Martinelli   +12 more
wiley   +1 more source

A goodness‐of‐fit test for regression models with discrete outcomes

Canadian Journal of Statistics, EarlyView.
Abstract Regression models are often used to analyze discrete outcomes, but classical goodness‐of‐fit tests such as those based on the deviance or Pearson's statistic can be misleading or have little power in this context. To address this issue, we propose a new test, inspired by the work of Czado et al.
Lu Yang, Christian Genest, Johanna G. Nešlehová   +2 more
wiley   +1 more source

Functionally complementary bacterial inoculant coordinates arbuscular mycorrhizal fungi to improve Angelica sinensis root yield and quality

iMetaOmics, EarlyView.
Comprehensive understanding of how diverse PGPR strains enhance the rhizosphere microenvironment remains a considerable challenge. Here, we provide experimental evidence that a functionally synergistic composite microbial formulation can markedly enhance growth performance and improve the quality attributes in Angelica sinensis.
Zongyu Zhang, Yun Wang, Jiecai Zhao, Gaofeng Chen, Andéole Niyongabo Turatsinze, Liang Yue, Yuan Tian, Xiaofan Xie, Ailing Ye, Meilan Zhang, Lingling Wu, Zengxiang Guo, Yubao Zhang, Ruoyu Wang   +13 more
wiley   +1 more source