Results 31 to 40 of about 166,225,520 (254)
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
FEBS Letters, EarlyView.Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
On the Normalized Laplacian and the Number of Spanning Trees of Linear Heptagonal Networks
Mathematics, 2019 The normalized Laplacian plays an important role on studying the structure properties of non-regular networks. In fact, it focuses on the interplay between the structure properties and the eigenvalues of networks. Let H n be the linear heptagonal
Jia-Bao Liu +3 more
doaj +1 more source
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.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
FEBS Open Bio, EarlyView.The presence of biotin‐binding avidin proteins in fish and their biological significance are poorly characterized. We cataloged fish avidins and demonstrate that they are widely present and evolutionarily conserved. We created avd knockout zebrafish and show that zebavidin is dispensable for development and that resistance of avd knockout embryos in ...
Anni K. Saralahti +5 more
wiley +1 more source
A Note on the Flip Distance between Non-crossing Spanning Trees
Computing in Geometry and Topology, 2023 We consider spanning trees of n points in convex position whose edges are pairwise non-crossing. Applying a flip to such a tree consists in adding an edge and removing another so that the result is still a non-crossing spanning tree. Given two trees, we
Nicolas Bousquet +3 more
doaj +1 more source
A minimal cellulosome‐like system in Cellulosilyticum lentocellum
FEBS Open Bio, EarlyView.Cellulose‐degrading bacteria typically use cellulosomes, large multi‐enzyme complexes on a scaffold protein. In Cellulosilyticum lentocellum, we characterise a far smaller arrangement, a single scaffold bound to one cellulase through a single cohesin‐dockerin interaction.
John Allan +2 more
wiley +1 more source
On the number of decomposable trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A tree is called $k$-decomposable if it has a spanning forest whose components are all of size $k$. Analogously, a tree is called $T$-decomposable for a fixed tree $T$ if it has a spanning forest whose components are all isomorphic to $T$. In this paper,
Stephan G. Wagner
doaj +1 more source
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
Моделирование и анализ информационных систем, 2021 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k +
Alexander Valeryevich Smirnov
doaj +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
On the Complexity of Stacked Graphs Associated with Paths and Cycles
AxiomsThe complexity of a graph, defined as its number of spanning trees, serves as a key measure of network reliability. Stacked graphs constitute a significant and versatile class of graphs, formed by superimposing multiple copies of a base graph upon a ...
Salama Nagy Daoud, Ahmad Asiri
doaj +1 more source