A new strategy for synthesis of branched cyclic peptide by Asn side-chain hydrazide ligation

Here, we report a new strategy for rapid synthesis of branched peptide by side-chain hydrazide ligation at Asn. The hydrazide was converted to thioester at Asn side chain by NaNO₂ and thiol reagent, and sequential ligation with an N-terminus Cys-peptide efficiently afforded the branched peptide. A branched cyclic peptide was successfully synthesized by side-chain ligation with a two-Cys-peptide and formation of a disulfide bond. This approach provides a new way for expeditious synthesis of branched peptides and facilitates the design of neopeptides as functional bio-mimics.     

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Multicyclic polyethers derived from 1,1,1‐tris(4‐hydroxyphenyl)ethane and 2,6‐dihalopyridines

Poly(pyridine ether)s were prepared in two ways: the polycondensation of silylated 1,1,1‐tris(4‐hydroxyphenyl)ethane (THPE) with 2,6‐difluoropyridine (method A) and the polycondensation of free THPE with 2,6‐dichloropyridine (method B). With method A, the THPE/difluoropyridine feed ratio was varied from 1.0:1.0 to 1.0:1.6. Cycles, bicycles, and multicycles were the main reaction products, and crosslinking was never observed. When ideal stoichiometry was used exclusively, multicycles free of functional groups were obtained. These multicycles were detectable in matrix‐assisted laser desorption/ionization time‐of‐flight (MALDI‐TOF) mass spectra up to B₃₈C₇₆ with a mass of approximately 32,000 Da. With method B, the reaction conditions were varied at a fixed feed ratio to achieve an optimum for the preparation of multicyclic polyethers, but because of the lower reactivity of 2,6‐dichloropyridine, a quantitative conversion was not achieved. The reaction products were characterized with MALDI‐TOF mass spectrometry, viscosity measurements, and size exclusion chromatography. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 5725–5735, 2004     

The Covering Radius of Ternary Cyclic Codes with Length up to 25

The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated.     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007     

关于NF-环的构造

研究了无限的ＮＦ－环及有限的ＮＦ－环，并且给出了有限ＮＦ－环的构造．     

Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.     

New classes of 2-weight cyclic codes

We introduce new classes of 2-weight cyclic codes which are direct sums of 1-weight irreducible cyclic codes