Results 141 to 150 of about 10,152,062 (308)
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
FEBS Letters, EarlyView.Vacuolar H+‐ATPase (V‐ATPase) is a multisubunit rotary proton pump that acidifies intracellular compartments. Using elastic network models, we identified conserved hinge residues that govern its large‐scale functional motions. We show that intrinsically encoded ‘soft modes’ drive critical functional transitions, including rotary catalysis and ...
Diksha Parwana +3 more
wiley +1 more source
Ramsey Numbers of Connected Clique Matchings
The Electronic Journal of Combinatorics, 2017 We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2-r-1)n-r+1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint copies of $K_r$, and that this number of vertices cannot be reduced.
openaire +4 more sources
Is there a Superior Distance Function for Matching in Small Samples? [PDF]
The study contributes to the development of ’standards’ for the application of matching algorithms in empirical evaluation studies. The focus is on the first step of the matching procedure, the choice of an appropriate distance function.
Claudia Becker +2 more
core
Molecular Oncology, EarlyView.In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
The number of maximal matchings in polygon rings
Discrete Applied MathematicsA matching of graph $G$ is maximal if it cannot be expanded by adding any edge to create a larger matching. In this paper, for a hexagonal ring $H$ with $n$ hexagons, we show that the number of maximal matchings of $H$ equals to the trace of the product of $n$ matrices, each of which is $S$, $L$, or $R$ according to the type of the connection mode of ...
Chengqi Li, Jinhui Yin, Lingjuan Shi
openaire +2 more sources
Regional Matching Frictions and Aggregate Unemployment [PDF]
The study shows that a stochastic frontier approach applied to regional level data offers a convenient and interesting method to examine how regional differences in matching efficiency and structural factors contribute to aggregate unemployment.
Jaakko Pehkonen +2 more
core
Molecular Oncology, EarlyView.Cytarabine is a key therapy for acute myeloid leukaemia (AML), but its efficacy is limited by the dNTPase SAMHD1, which hydrolyses its active metabolite. Screening nucleotide biosynthesis inhibitors revealed that IMPDH inhibitors selectively sensitise SAMHD1‐proficient AML cells to cytarabine.
Miriam Yagüe‐Capilla +9 more
wiley +1 more source
Reasoning about Record Matching Rules [PDF]
, 2009 To accurately match records it is often necessary to utilize the semantics of the data. Functional dependencies (FDs) have proven useful in identifying tuples in a clean relation, based on the semantics of the data. For all the reasons that FDs and their
Li, Jianzhong +3 more
core
KDM7A and KDM1A inhibition suppresses tumour promoting pathways in prostate cancer
Molecular Oncology, EarlyView.Treatment resistance is a major challenge for patients with advanced prostate cancer. This study examined an alternative approach to target the major prostate cancer‐promoting pathway by targeting epigenetic factors, whose levels are higher in tumours.
Jennie N Jeyapalan +16 more
wiley +1 more source