Results 61 to 70 of about 3,239,599 (306)

Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions

FEBS Letters, EarlyView.
The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang, Hyo Been Jin, Chang Min Kim, So Yeon Lee, Hyun Ho Park   +4 more
wiley   +1 more source

Computing the Permanent of the Laplacian Matrices of Nonbipartite Graphs

Journal of Mathematics, 2021
Let G be a graph with Laplacian matrix LG. Denote by per LG the permanent of LG. In this study, we investigate the problem of computing the permanent of the Laplacian matrix of nonbipartite graphs.
Xiaoxue Hu, Grace Kalaso
doaj   +1 more source

Sloppy-Model Universality Class and the Vandermonde Matrix [PDF]

Physical Review Letters, 2006
In a variety of contexts, physicists study complex, nonlinear models with many unknown or tunable parameters to explain experimental data. We explain why such systems so often are sloppy; the system behavior depends only on a few `stiff' combinations of the parameters and is unchanged as other `sloppy' parameter combinations vary by orders of magnitude.
Waterfall, Joshua J., Casey, Fergal P., Gutenkunst, Ryan N., Brown, Kevin S., Myers, Christopher R., Brouwer, Piet W., Elser, Veit, Sethna, James P.   +7 more
openaire   +3 more sources

Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation

FEBS Letters, EarlyView.
Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang, Ruslana Romaniuk, Hristo L. Svilenov   +2 more
wiley   +1 more source

Characteristic Polynomial of Antiadjacency Matrix of Several Classes of Graph Join

Indonesian Journal of Combinatorics
Suppose G is a simple and undirected graph. The adjacency matrix of graph G, denoted by A(G) is a square matrix that representing graph G based on the adjacency of vertices on G, denoted by A(G). The antiadjacency matrix of graph G is a matrix B(G)=J−A(G)
Anthony Arthur Ataupah, Ganesha Lapenangga Putra   +1 more
doaj   +1 more source

Characterizations of Matrix and Compact Operators on BK Spaces

Universal Journal of Mathematics and Applications, 2023
In the present paper, by estimating operator norms, we give some characterizations of infinite matrix classes $\left( \left\vert E_{\mu }^{r}\right\vert _{q},\Lambda\right) $ and $\left( \left\vert E_{\mu }^{r}\right\vert _{\infty },\Lambda\right ...
Fadime Gökçe
doaj   +1 more source

Dihedral transportation and (0, 1)-matrix classes [PDF]

Linear and Multilinear Algebra, 2017
Let R and S be two vectors of real numbers whose entries have the same sum. In the transportation problems one wishes to find a matrix A with row sum vector R and column sum vector S. If, in addition, the two vectors only contain nonnegative integers then one wants the same to be true for A.
Brualdi, Richard A., Sagan, Bruce E.
openaire   +2 more sources

On the use of certain matrix algebras associated with trigonometric transforms in matrix displacement decomposition

, 1995
The authors extend some recent results of Di Fiore and Zellini [Linear Algebra Appl., to appear], obtaining new classes of formulas for the displacement operator-based decomposition of matrices. It is shown how an arbitrary matrix can be expressed as the
Bozzo, E, Di Fiore, C, DI FIORE C., DI FIORE, CARMINE, BOZZO, Enrico   +4 more
core   +1 more source

Language classes associated with automata over matrix groups [PDF]

, 2018
We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group automata where the
Özlem Salehi, A.C. Cem Say, Say, A. C. Cem, Say, Cem, Salehi, Ozlem, Say, A.C. Cem, Özlem, Salehi, Flavio D’Alessandro, Cem Say, A. C., D’Alessandro, Flavio, D'ALESSANDRO, Flavio   +10 more
core   +1 more source

On types and classes of commuting matrices over finite fields

, 2011
This paper addresses various questions about pairs of similarity classes of matrices that contain commuting elements. In the case of matrices over finite fields, we show that the problem of determining such pairs reduces to a question about nilpotent ...
John R. Britnell, Mark Wildon, Britnell, JR, Wildon M, Britnell JR, Wildon, MJ   +5 more
core   +4 more sources