Results 81 to 90 of about 3,067,250 (321)
The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity
FEBS Letters, EarlyView.The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley +1 more source
New Bounds For Degree Sequence Of Graphs [PDF]
Computer Science Journal of Moldova, 2019 Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and
Akbar Jahanbani
doaj
A permutation method for network assembly.
PLoS ONE, 2020 We present a method for assembling directed networks given a prescribed bi-degree (in- and out-degree) sequence. This method utilises permutations of initial adjacency matrix assemblies that conform to the prescribed in-degree sequence, yet violate the ...
Shawn A Means +2 more
doaj +1 more source
A Tur\'an-type problem on degree sequence [PDF]
, 2013 Given $p\geq 0$ and a graph $G$ whose degree sequence is $d_1,d_2,\ldots,d_n$, let $e_p(G)=\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\'an-type problem for $e_p(G)$: given $p\geq 0$, how large can $e_p(G)$ be if $G$ has no subgraph of a ...
Li, Xueliang, Shi, Yongtang
core
Molecular bases of circadian magnesium rhythms across eukaryotes
FEBS Letters, EarlyView.Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley +1 more source
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
On factorable degree sequences
Journal of Combinatorial Theory, Series B, 1972 AbstractWe call a degree sequence graphic (respectively, k-factorable, connected k-factorable) if there exists a graph (respectively, a graph with a k-factor, a graph with a connected k-factor) with the given degree sequence. In this paper we give a necessary and sufficient condition for a k-factorable sequence to be connected k-factorable when k ⩾ 2 ...
Ramachandra Rao, A, Rao, S.B
openaire +1 more source
Peptide‐based ligand antagonists block a Vibrio cholerae adhesin
FEBS Letters, EarlyView.The structure of a peptide‐binding domain of the Vibrio cholerae adhesin FrhA was solved by X‐ray crystallography, revealing how the inhibitory peptide AGYTD binds tightly at its Ca2+‐coordinated pocket. Structure‐guided design incorporating D‐amino acids enhanced binding affinity, providing a foundation for developing anti‐adhesion therapeutics ...
Mingyu Wang +9 more
wiley +1 more source
Informatica, 2019 Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph $G_1$ that realizes $\pi_1$.
Csaba, Béla, Vásárhelyi, Bálint
openaire +4 more sources
Extremal Topological Indices with Prescribed Degree Sequences
Vestnik KRAUNC: Fiziko-Matematičeskie NaukiThis paper explores the extremal properties and bounds of two significant topological indices in graph theory: the Albertson and Sigma indices, with an emphasis on trees and bipartite graphs.
Hamoud, J., Belov, A.Ya.
doaj +1 more source