Results 51 to 60 of about 10,299 (219)

Large‐Scale Genomics Reveals Three‐Source Ancestry and Layered Adaptation to High Altitude in Tibetan Chickens

Advanced Science, EarlyView.
Whole‐genome analysis of 1,054 chickens reveals three ancestral sources (NWC, SYA, and SHF) with distinct temporal entry patterns into the Tibetan Plateau. Route‐specific selection scans, calibrated against a demographic null, suggest complementary functional enrichments—vascular homeostasis (NWC), calcium signaling and cardiac adaptation (SYA), and ...
Zongyi Zhao, Ruixue Nie, Hailu Fan, Tenzin Ngodroup, Li Zhu, Hongbin Pan, Bo Zhang, Hao Zhang   +7 more
wiley   +1 more source

Bipartite permutation graphs

Discrete Applied Mathematics, 1987
It is shown that bipartite permutation graphs have good algorithmic properties in contrast to general bipartite or permutation graphs. Two characterizations of these graphs are presented which lead to a linear time recognition algorithm and also to polynomial algorithms for Hamiltonian problems, a variant of the crossing number problem and the minimum ...
Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart   +2 more
openaire   +1 more source

A Phase‐Resolved Geometric Deep Learning Framework Maps Structural Determinants of Disease‐Associated Protein Aggregation and Guides Suppressor Design

Advanced Science, EarlyView.
SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio, Wei Xuan Wilson Loo, Yan Shan Loo, Wen Xin Tan, Hui Xuan Lim, Huitao Liu, Chen Seng Ng   +6 more
wiley   +1 more source

Minimum k-critical-bipartite graphs: the irregular case [PDF]

Opuscula Mathematica
We study the problem of finding a minimum \(k\)-critical-bipartite graph of order \((n,m)\): a bipartite graph \(G=(U,V;E)\), with \(|U|=n\), \(|V|=m\), and \(n\gt m\gt 1\), which is \(k\)-critical-bipartite, and the tuple \((|E|, \Delta_U, \Delta_V ...
Sylwia Cichacz, Agnieszka Görlich, Karol Suchan   +2 more
doaj   +1 more source

Koszul Bipartite Graphs

Advances in Applied Mathematics, 1999
Let \(R = K[t_1, \ldots , t_d]\) be the polynomial ring in \(d\) indeterminates over a field \(K\). If \(G\) is a bipartite graph on the vertex set \(\{ 1, \ldots , d \}\), define \(K[G]\) to be the subalgebra of \(R\) generated by all monomials \(t_i t_j\) such that \(\{ i,j \}\) is an edge of \(G\). It is shown that if every \(n\)-cycle \((n \geq 6)\)
Ohsugi, Hidefumi, Hibi, Takayuki
openaire   +2 more sources

TDP‐43 Aggregation: The Healthy‐Toxic Balance of the Prion‐Like Domain

Advanced Science, EarlyView.
TDP‐43 function relies on a delicate balance between reversible phase‐separated states and irreversible aggregation. Under physiological conditions, TDP‐43 forms dynamic droplets and oligomers that support normal cellular functions. In pathological contexts, this balance shifts toward aberrant aggregation, leading to toxic species.
Luca Zangrando, Emanuele Buratti, Francesca Paron   +2 more
wiley   +1 more source

Materials Representation Learning Based on a Material–Motif Network and Heterogeneous Graphs

Advanced Intelligent Discovery, EarlyView.
Structure motifs in materials are used to construct a bipartite material–motif network that links each material to its constituent motifs and establishes connectivity among materials sharing common motifs. Network analysis reveals material clusters associated with different functional applications and supports motif‐guided screening of materials.
Anoj Aryal, Weiyi Gong, Huta Banjade, Qimin Yan   +3 more
wiley   +1 more source

Semantic Web Service Discovery Based on Clustering and Bipartite Graph Matching [PDF]

Jisuanji gongcheng, 2016
In order to efficiently and accurately locate semantic Web service,a new semantic Web service discovery method is proposed based on clustering and bipartite graph matching.In this method,services are clustered according to the service description ...
LIU Yisong,ZHU Dan
doaj   +1 more source

In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro

Advanced Intelligent Systems, EarlyView.
This article reported a continuous‐time (CT) Boolean satisfiability (SAT) problem solver using bidirectional 11T‐SRAM macro. The proposed system operates asynchronously using capacitor‐based gradient integration and maximizes the parallelism for SAT solving by in‐memory computing (IMC).
Dongseok Kwon, Tinish Bhattacharya, George Higgins Hutchinson, Dmitri Strukov   +3 more
wiley   +1 more source

Ore Image Segmentation by Bipartite Graph Based on Collaborative Representation [PDF]

Jisuanji gongcheng, 2016
Image segmentation algorithm by bipartite graph considers the spatial organization relation between superpixels as well as pixel and superpixels,which is robust for ore image segmentation.This paper proposes a bipartite graph algorithm based on ...
ZHOU Jing,YANG Fan,SHI Lingyi,ZHENG Zhonglong
doaj   +1 more source