Results 71 to 80 of about 1,265 (189)
The R203W substitution drives PACS‐1 syndrome by disrupting intramolecular regulation
The middle region (MR) of PACS‐1 controls engagement with specific partner proteins. This manuscript presents the structure of the Furin binding region (FBR) and how interactions with partners are regulated through the interplay between a basic patch in the FBR and an acidic cluster in the MR.
Troy C. Krzysiak +7 more
wiley +1 more source
Primary forests hosted more diurnal species and exhibited significant diel specialization. Secondary forests were less species‐rich, dominated by invasive ants, with reduced diel partitioning and more species active at night. Although the overall ant activity was higher during the day, this pattern was stratum‐dependent: arboreal and terrestrial ants ...
Jan Lenc +4 more
wiley +1 more source
Bipartite Embeddings of Trees in the Plane
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings.
Noy, M. +4 more
core +1 more source
Linking the Comparison and Graphical Approaches to Bipartite Matching
Summary Bipartite record linkage has the goal of identifying observations referring to the same individual, called coreferent observations, across two distinct non‐duplicated datasets. The two main approaches to solve this task are the Fellegi–Sunter model, which relies on pairwise comparisons of observations, and the graphical record linkage model ...
Edoardo Redivo
wiley +1 more source
A note on the number of perfect matchings of bipartite graphs
Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s ϵ {1, 2, …}, an elegant formula, i.e. det A =
Zhang Fuji +3 more
core +2 more sources
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka +5 more
core
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
How to optimise tournament draws: The case of the FIFA World Cup
Abstract The organisers of major sports competitions use different policies with respect to constraints in the group draw. Our paper aims to rationalise these choices by analysing the trade‐off between attractiveness (the number of games played by teams from the same geographic zone) and fairness (the departure of the draw mechanism from a uniform ...
László Csató
wiley +1 more source
Hamiltonian cycles in bipartite plane cubic maps
Vita.The nature of bipartite cubic plane maps is investigated relative to questions concerning connectedness, local structure, and the line graph. Several contributions are made toward the solution of the conjecture of Barnette that each 3-connected ...
Peterson, Douglas Lee
core
Three genotypes – a heat‐resistant maize (Zea mays), a heat‐susceptible maize, and a sorghum (Sorghum bicolor) variety – were grown to the V4 stage in growth chambers under optimal conditions or subjected to heat stress. Plants were grown in soil containing a complex microbial community, or in the same soil with a depleted microbiome.
Nate Korth +5 more
wiley +1 more source

