Results 51 to 60 of about 2,511 (267)
The asymptotic existence of group divisible designs of large order with index one
This paper gives the answer to a question of R.M. Wilson regarding the existence of group divisible designs of large order. Let k and u be positive integers such that 2⩽k⩽u. Then there exists an integer m0=m0(k,u) such that there exists a group divisible
Hedvig Mohácsy, Mohácsy, Hedvig
core +1 more source
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
Strongly regular graphs and group divisible designs [PDF]
0. Introduction. In the present paper, we use the counting techniques of the author's earlier work [5] to prove the converse of a result of R.C. Bose and S.S. Shrikhande [3] on geometric and pseudo-geometric graphs (q + l,q+H). Section 1 is devoted to preliminaries on strongly regular graphs and group divisible designs. We also give a brief description
openaire +3 more sources
New constructions of divisible designs
A construction is given for a (p2a(p+1),p2,p2a+1(p+1),p2a+1,p2a(p+1)) (p a prime) divisible difference set in the group H×Z2pa+1 where H is any abelian group of order p+1.
James A. Davis +2 more
core +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
PAIRWISE BALANCED, SEMI-REGULAR AND REGULAR GROUP DIVISIBLE DESIGNS
From a regular group divisible design a method of constructing a pairwise balanced design and a semi-regular group divisible design is ...
景山, 三平 +2 more
core
Resolvable group divisible designs with block size 3
Let v be a non negative integer, let λ be a positive integer, and let K and M be sets of positive integers. A group divisible design, denoted by GD[K, λ, M, v], is a triple (X, Г, β) where X is a set of points, Г = {G1, G2,…} is a partition of X, and β ...
Assaf, Ahmed M., Hartman, Alan
core +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
More about Divisible Design Graphs [PDF]
: Divisible design graphs (DDG for short) have been recently defined by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs.
Haemers, W.H.; id_orcid +2 more
core
Further results on large sets of disjoint group-divisible designs
This paper is a continuation of a recent paper by Chen and Stinson, where some recursive constructions for large sets of group-divisible design with block size 3 are presented. In this paper, we give two new recursive constructions.
Lindner, C.C., Stinson, D.R., Chen, D.
core +1 more source

