| 4 | Filling the Gaps to Solve the Extensin Puzzle显示文摘Extensins (EXT ) 是高度重复的植物 O-glycoproteins 要求几 translational 以后修正(PTM ) 在植物房间墙中变得功能。首先,他们是连续脯氨酸残余上的 hydroxylated;然后 ? 他们是 hydroxyproline 上的 O-glycosylated ? 并且丝氨酸。在进 apoplast 的分泌物以后, O-glycosylated EXT 形成 inter-Tyr 和 intra-Tyr 连接组织的一个三度空间的网络。最近的研究在要求处理 EXT 的酶的机械的鉴定取得了重要进步,它包括 prolyl 4-hydroxylases, glycosyltransferases, papain 类型半胱氨酸 endopeptidases,和 peroxidases。EXT 充满植物纸巾 ? 并且在很快扩展根头发和花粉试管是特别地重要的,它以一种极的方式成长。在 EXT PTM 的小面值硬币影响快成长的房间,尽管位于这条规定下面的分子的机制是未知的。在这评论,我们在整个能分泌的小径,在房间墙中的 EXT 集会,和包含 Catharanthus roseus 房间表面传感器的可能的察觉到机制在我们 EXT 修正的理解加亮最近的进展像受体的 kinases ? 在在 apoplast 和血浆膜的细胞质的方面之间的接口定位了。 | Eliana Marzol Cecilia Borassi Mauro Bringas Ana Sede Diana Rosa Rodriguez Garcia Luciana Capece Jose M. Estevez | 2018 | Molecular Plant2018，11，5： | 2 |
| 15 | On a Classical Theorem on the Diameter and Minimum Degree of a Graph显示文摘In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erd¨os, Pach, Pollack and Tuza.We use these bounds in order to study hyperbolic graphs(in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H(n, δ_0) be the set of graphs G with n vertices and minimum degree δ_0, and J(n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a(n, δ_0) = min{δ(G) | G ∈ H(n, δ_0)}, b(n, δ_0) = max{δ(G) |G ∈ H(n, δ_0)}, α(n, Δ) = min{δ(G) | G ∈ J(n, Δ)} and β(n, Δ) = max{δ(G) | G ∈ J(n, Δ)}. In particular, we obtain bounds for b(n, δ_0) and we compute the precise value of a(n, δ_0), α(n, Δ) andβ(n, Δ) for all values of n, δ_0 and Δ, respectively. | Veronica HERNANDEZ Domingo PESTANA Jose M. RODRIGUEZ | 2017 | Acta Mathematica Sinica,English Series2017，33，11： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员