Results 71 to 80 of about 7,886 (170)
Large language models for bioinformatics
Quantitative Biology, Volume 14, Issue 1, March 2026.Abstract With the rapid advancements in large language model technology and the emergence of bioinformatics‐specific language models (BioLMs), there is a growing need for a comprehensive analysis of the current landscape, computational characteristics, and diverse applications.
Wei Ruan +54 more
wiley +1 more source
A comprehensive review of cluster methods for drug–drug interaction network
Quantitative Biology, Volume 14, Issue 1, March 2026.Abstract The detection of drug–drug interaction (DDI) is crucial to the rational use of drug combinations. Experimentally, DDI detection is time‐consuming and laborious. Currently, researchers have developed a variety of computational methods to predict DDI.
Shuyuan Cao +3 more
wiley +1 more source
Two-regular subgraphs of hypergraphs
Journal of Combinatorial Theory, Series B, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mubayi, Dhruv, Verstraëte, Jacques
openaire +2 more sources
Zarankiewicz bounds from distal regularity lemma
Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley +1 more source
New strong colouring of hypergraphs
Le Matematiche, 2011 We define a new colouring for a hypergraph, in particular for a graph. Such a method is a partition of the vertex-set of a hypergraph, in particular of a graph.
Sandro Rajola, Maria Scafati Tallini
doaj
The hypergraph regularity method and its applications [PDF]
Proceedings of the National Academy of Sciences, 2005 Szemerédi's regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a given isomorphism type, yielding the so-called counting lemma for graphs.
Rödl, V. +4 more
openaire +3 more sources
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract Heilbronn's triangle problem is a classical question in discrete geometry. It asks to determine the smallest number Δ=Δ(N)$\Delta = \Delta (N)$ for which every collection in N$N$ points in the unit square spans a triangle with area at most Δ$\Delta$.
Dmitrii Zakharov
wiley +1 more source
Definition and Computation of Tensor‐Based Generalized Function Composition
Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.ABSTRACT Functions are fundamental to mathematics as they offer a structured and analytical framework to express relations between variables. While scalar and matrix‐based functions are well‐established, higher‐order tensor‐based functions have not been as extensively explored.
Remy Boyer
wiley +1 more source
Matchings on Random Regular Hypergraphs
, 2021 We prove the convergence in probability of free energy for matchings on random regular, uniform hypergraphs and explicitly compute the limit. We also obtain a region on parameters where replica symmetry holds.
openaire +2 more sources
Lightweight Hybrid Wafer Defect Pattern Network Based on Feedforward Efficient Attention
CAAI Transactions on Intelligence Technology, Volume 11, Issue 1, Page 149-166, February 2026.ABSTRACT With the increase of semiconductor integration density, in order to cope with the increase of wafer defect complexity and types, especially the low recognition accuracy of overlapping mixed defects and unknown wafer defects, this study proposes a lightweight model for wafer defect detection called LightWMNet.
Zhiqiang Hu, Yiquan Wu
wiley +1 more source