Results 101 to 110 of about 20,650,729 (303)
Modelling stem cell differentiation related processes—A practical overview for biologists
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Fractional matching preclusion for butterfly derived networks
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Xia Wang +4 more
doaj +1 more source
The Size of a Hypergraph and its Matching Number [PDF]
More than forty years ago, Erdős conjectured that for any $t \leq \frac{n}{k}$, every k-uniform hypergraph on n vertices without t disjoint edges has at most max${\binom{kt-1}{k}, \binom{n}{k}-\binom{n-t+1}{k}\}$ edges. Although this appears to be a basic instance of the hypergraph Turán problem (with a t-edge matching as the excluded hypergraph ...
Hao Huang 0005 +2 more
openaire +3 more sources
Design and analysis strategies for robust microbiome ageing research
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
On the permanental nullity and matching number of graphs [PDF]
For a graph G with n vertices, let and A(G) denote the matching number and adjacency matrix of G, respectively. The permanental polynomial of G is defined as . The permanental nullity of G, denoted by , is the multiplicity of the zero root of .
Ting-Zeng Wu, Hong-Jian Lai
semanticscholar +1 more source
The Hierarchy of Saturating Matching Numbers
In this paper, we study three matching problems all of which came up quite recently in the field of machine teaching. The cost of a matching is defined in such a way that, for some formal model of teaching, it equals (or bounds) the number of labeled examples needed to solve a given teaching task.
Hans Ulrich Simon, Jan Arne Telle
openaire +2 more sources
Estimating Matching Games with Transfers [PDF]
Economists wish to use data on matches to learn about the structural primitives that govern sorting. I show how to use equilibrium data on who matches with whom for semiparametric estimation of match production functions in many-to-many, two-sided ...
Jeremy T. Fox
core
Reconstructing enzyme evolution by protein engineering
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
New Results on Graph Matching from Degree-Preserving Growth
The recently introduced model in S. R. Kharel et al.’s study [Degree-preserving network growth. Nature Physics 2022, 18, 100–106] uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence.
Péter L. Erdős +3 more
doaj +1 more source
Image reconstruction algorithm based on variable atomic number matching pursuit
As the most critical part of compressive sensing theory, reconstruction algorithm has an impact on the quality and speed of image reconstruction. After studying some existing convex optimization algorithms and greedy algorithms, we find that convex ...
Hongtu Zhao, Chong Chen, Chenxu Shi
doaj +1 more source

