Results 121 to 130 of about 92,446 (202)
SAGE is a unified framework for spatial domain identification in spatial transcriptomics that jointly models tissue architecture and gene programs. Topic‐driven gene selection (NMF plus classifier‐based scoring) highlights spatially informative genes, while dual‐view graph embedding fuses local expression and non‐local functional relations.
Yi He +5 more
wiley +1 more source
Tumor relevant protein functional interactions identified using bipartite graph analyses. [PDF]
Venkatraman DL +3 more
europepmc +1 more source
Perceived Saturation in Normal and Red–Green Color‐Deficient Observers
Results in this study indicate that perceived saturation of protan (P) and deutan (D) observers is lower than that of color normal (N) observers as shown in the figures. Horizontal axis denotes the stimulus pair with the same hue but different chroma.
Miyoshi Ayama +2 more
wiley +1 more source
Bipartite graph-based approach for clustering of cell lines by gene expression-drug response associations. [PDF]
Chi C, Ye Y, Chen B, Huang H.
europepmc +1 more source
ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira +4 more
wiley +1 more source
Quasi-Irreducibility of Nonnegative Biquadratic Tensors
While the adjacency tensor of a bipartite 2-graph is a nonnegative biquadratic tensor, it is inherently reducible. To address this limitation, we introduce the concept of quasi-irreducibility in this paper.
Liqun Qi, Chunfeng Cui, Yi Xu
doaj +1 more source
Bipartite graph-based collaborative matrix factorization method for predicting miRNA-disease associations. [PDF]
Zhou F +5 more
europepmc +1 more source
Perfect Matching Under Precedence Constraints
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source
GAGrank: Software for Glycosaminoglycan Sequence Ranking Using a Bipartite Graph Model. [PDF]
Hogan JD +5 more
europepmc +1 more source

