Results 51 to 60 of about 11,781 (210)

On Certain Types of Neutrosophic Fuzzy Graphs

Pan-American Journal of Mathematics, 2022
In this paper, we introduce some types of NF graphs and operations. Also we define the partial NF subgraph, spanning NF subgraph, strong degree of the vertex, total strong degree of the vertex and its properties are included.
Alias B. Khalaf, Prithivirajan Padma
doaj   +1 more source

Persistently Increased Expression of PKMzeta and Unbiased Gene Expression Profiles Identify Hippocampal Molecular Traces of a Long‐Term Active Place Avoidance Memory and “Shadow” Proteins

Advanced Science, EarlyView.
Protein complexes like KIBRA‐PKMζ are crucial for maintaining memories, forming month‐long protein traces in memory‐tagged neurons, but conventional RNA‐seq analysis fails to detect their transcript changes, leaving memory molecules undetected in the shadows of abundantly‐expressed genes.
Jiyeon Han, Alejandro Grau‐Perales, Rayna M. Harris, Edith Lesburguères, Hsin‐Yi Kao, Asit Pal, Juan Marcos Alarcon, Todd C. Sacktor, Stefano Martiniani, Hans A. Hofmann, André A. Fenton   +10 more
wiley   +1 more source

PAIR: Reconstructing Single‐Cell Open‐Chromatin Landscapes for Transcription Factor Regulome Mapping

Advanced Science, EarlyView.
scATAC‐seq analysis is often constrained by limited sequencing depth, extreme sparsity, and pervasive technical missingness. PAIR is a probabilistic framework that restores scATAC‐seq accessibility profiles by directly modeling the native cell–peak bipartite structure of chromatin accessibility.
Yanchi Su, Qi Qi, Yi Fan, Yubo Wang, Gaoyang Hao, Ka‐Chun Wong, Yunhe Wang, Xiangtao Li   +7 more
wiley   +1 more source

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

Revealing Protein–Protein Interactions Using a Graph Theory‐Augmented Deep Learning Approach

Advanced Intelligent Discovery, EarlyView.
This study presents a fast, cost‐efficient approach for classifying protein–protein interactions by integrating graph‐theory parametrization with deep learning (DL). Multiscale features extracted from graph‐encoded polarized‐light microscopy (PLM) images enable accurate prediction of binding strengths.
Bahar Dadfar, Gözde Kabay, Matthias Franzreb, Kody Whisnant, Nicholas A. Kotov, Joerg Lahann   +5 more
wiley   +1 more source

Artificial Intelligence for Multiscale Modeling in Solid‐State Physics and Chemistry: A Comprehensive Review

Advanced Intelligent Systems, EarlyView.
This review explores the transformative impact of artificial intelligence on multiscale modeling in materials research. It highlights advancements such as machine learning force fields and graph neural networks, which enhance predictive capabilities while reducing computational costs in various applications.
Artem Maevskiy, Vitalii Kapitan, Andrey Ustyuzhanin   +2 more
wiley   +1 more source

In Silico Approach for Antibacterial Discovery: PTML Modeling of Virtual Multi-Strain Inhibitors Against Staphylococcus aureus

Pharmaceuticals
Background/Objectives: Infectious diseases caused by Staphylococcus aureus (S. aureus) have become alarming health issues worldwide due to the ever-increasing emergence of multidrug resistance.
Valeria V. Kleandrova, M. Natália D. S. Cordeiro, Alejandro Speck-Planche   +2 more
doaj   +1 more source

Ascending subgraph decomposition

Journal of Combinatorial Theory, Series B
A typical theme for many well-known decomposition problems is to show that some obvious necessary conditions for decomposing a graph $G$ into copies $H_1, \ldots, H_m$ are also sufficient. One such problem was posed in 1987, by Alavi, Boals, Chartrand, Erdős, and Oellerman. They conjectured that the edges of every graph with $\binom{m+1}2$ edges can be
Katsamaktsis, Kyriakos, Letzter, Shoham, Pokrovskiy, Alexey, Sudakov, Benny   +3 more
openaire   +3 more sources

Full subgraphs

Journal of Graph Theory, 2017
AbstractLet be a graph of density p on n vertices. Following Erdős, Łuczak, and Spencer, an m‐vertex subgraph H of G is called full if H has minimum degree at least . Let denote the order of a largest full subgraph of G. If is a nonnegative integer, define urn:x-wiley:03649024:media:jgt22221:jgt22221-math-0005Erdős, Łuczak, and Spencer proved that ...
Victor Falgas‐Ravry, Klas Markström, Jacques Verstraëte   +2 more
openaire   +4 more sources

Causal analysis of extreme risk in a network of industry portfolios

Canadian Journal of Statistics, EarlyView.
Abstract We provide a detailed review of causal dependence within the framework of max‐linear structural models. Such models express each node variable as a max‐linear function of its parental node variables in a directed acyclic graph (DAG) and some exogenous innovation.
Claudia Klüppelberg, Mario Krali
wiley   +1 more source