Results 81 to 90 of about 10,229,767 (397)
On almost distance-regular graphs [PDF]
Distance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study `almost distance-regular graphs'.
arxiv +1 more source
There are several algorithms to solve many problems in grouping data. Grouping data is also known as clusterization, clustering takes advantage to solve some problems especially in business. In this note, we will modify the clustering algorithm based on distance principle which background of K-means algorithm (Euclidean distance).
Said Al Afghani+1 more
openaire +2 more sources
The glacier ice worm Mesenchytraeus solifugus survives year‐round at 0 °C. Its ATP6 subunit, which forms a regulatory component of the proton pore in mitochondrial ATP synthase, has a carboxy‐terminal extension not found in any other organism examined to date. Here, we show that fusion of this extension to the homologous AtpB protein in E. coli results
Truman Dunkley+2 more
wiley +1 more source
Evidence concerning the associations between QSOs and galaxies with similar redshifts, and pairs with very different redshifts is reviewed. It is concluded that both kinds of associations are likely to be real.
openaire +3 more sources
The interaction between Agrobacterium fabrum phytochromes Agp1 and Agp2 was studied using FRET. Full‐length and truncated proteins with varied label positions provided spatial insights, narrowing down from many docking models to three. These models explain Agp2's reduction in Agp1 autophosphorylation, with Arg83 of Agp2 specifically evolved to interact
Afaf El Kurdi+7 more
wiley +1 more source
Cosmological distance indicators
We review three distance measurement techniques beyond the local universe: (1) gravitational lens time delays, (2) baryon acoustic oscillation (BAO), and (3) HI intensity mapping.
A. Agnello+166 more
core +1 more source
FastME 2.0: A Comprehensive, Accurate, and Fast Distance-Based Phylogeny Inference Program
FastME provides distance algorithms to infer phylogenies. FastME is based on balanced minimum evolution, which is the very principle of Neighbor Joining (NJ).
Vincent Lefort, R. Desper, O. Gascuel
semanticscholar +1 more source
In modular polyketide synthases, the dehydratase (DH) domain catalyzes the dehydration reaction of the β‐hydroxyacyl unit attached to the cognate acyl carrier protein (ACP) domain. However, it is unclear how DH interacts with ACP during the reaction. In this study, we identified DH–ACP interface residues, providing the first detailed insights into DH ...
Kaede Kotagiri+8 more
wiley +1 more source
Polynomial Characterizations of Distance-Biregular Graphs [PDF]
Fiol, Garriga, and Yebra introduced the notion of pseudo-distance-regular vertices, which they used to develop a new characterization of distance-regular graphs. Building on that work, Fiol and Garriga developed the spectral excess theorem for distance-regular graphs. We extend both these characterizations to distancebiregular graphs and show how these
arxiv
Functional variation among LPMOs revealed by the inhibitory effects of cyanide and buffer ions
This study addresses the inhibition of lytic polysaccharide monooxygenases (LPMOs) by cyanide and explains how and why the magnitude of observed inhibitory effects depends on the way LPMO reactions are setup and on the type of LPMO. Enzymes known as lytic polysaccharide monooxygenases (LPMOs) are mono‐copper polysaccharide‐degrading peroxygenases that ...
Ole Golten+10 more
wiley +1 more source