Results 61 to 70 of about 617,805 (269)
Semantic Web Service Discovery Based on Clustering and Bipartite Graph Matching [PDF]
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
Computationally Evidence‐Grounded Sequence‐First Design of Peptide Binders
BOND‐PEP enables controllable, sequence‐first peptide binder design by grounding generation in binding evidence retrieved for each target. It uses topology‐conditioned message passing to integrate relevant peptide examples with the target protein sequence, forming a residue‐level representation that guides the generation of diverse, target‐specific ...
Wenze Ding
wiley +1 more source
Ore Image Segmentation by Bipartite Graph Based on Collaborative Representation [PDF]
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
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 +2 more
openaire +1 more source
MAPA transforms complex multi‐omics data into biologically coherent functional modules by integrating pathway information with molecular interaction networks. Retrieval‐augmented large language models then generate structured, literature‐informed interpretations.
Yifei Ge +13 more
wiley +1 more source
Decomposition of Certain Complete Bipartite Graphs into Prisms
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
This paper deals with bithreshold graphs and their characterization. After having given some necessary properties the authors succeed in proving a complete characterization of the class of bipartite bithreshold graphs by means of 11 not bithreshold (so-called forbidden induced subgraphs) and 5 classes of induced subgraphs.
Peter L. Hammer +2 more
openaire +1 more source
The transcription factor MoSR governs DMI fungicide sensitivity in Magnaporthe oryzae through dual regulation of ergosterol biosynthesis and the detoxification enzyme MoDde1. Targeting MoDde1 via a small‐molecule inhibitor or host‐induced gene silencing enhances DMI efficacy against rice blast, offering a sustainable disease management strategy ...
Fan‐Zhu Meng +10 more
wiley +1 more source
On balanced bipartitions of graphs [PDF]
Bollobás and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each for each In this paper, we consider the contrary side and show that every graphic sequence has a realization G which admits a balanced bipartite spanning subgraph H such that for each and we show that the bound is sharp.
openaire +3 more sources
Materials Representation Learning Based on a Material–Motif Network and Heterogeneous Graphs
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 +3 more
wiley +1 more source

