聚离子亚基化合物结构影响外源基因转染效率

合成了带正电荷密度不同的聚离子亚基化合物,探讨了聚合物结构对外源基因转染真核细胞的影响规律。从实验结果看,聚离子亚基化合物结构影响外源基因转染效率,但其影响程度与靶细胞的种类相关,对ＨｅＬａ细胞,ＮＩＨ３Ｔ３细胞,聚离子亚基化合物的正电荷密度加大,其促基因转移功能加强;而对ＰＡ３１７包装细胞,结果相反。     

Finding Adam in random growing trees

We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of K vertices, such that, with probability at least , the first vertex is in this set. We show that for any ε, there exist such algorithms with K independent of the size of the input tree. Moreover, we provide almost tight bounds for the best value of K as a function of ε. In the uniform attachment case we show that the optimal K is subpolynomial in , and that it has to be at least superpolylogarithmic. On the other hand, the preferential attachment case is exponentially harder, as we prove that the best K is polynomial in . We conclude the paper with several open problems. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 158–172, 2017     

On martingale tail sums for the path length in random trees

For a martingale (X_n) converging almost surely to a random variable X, the sequence (X_n– X) is called martingale tail sum. Recently, Neininger (Random Structures Algorithms 46 (2015), 346–361) proved a central limit theorem for the martingale tail sum of Régnier's martingale for the path length in random binary search trees. Grübel and Kabluchko (in press) gave an alternative proof also conjecturing a corresponding law of the iterated logarithm. We prove the central limit theorem with convergence of higher moments and the law of the iterated logarithm for a family of trees containing binary search trees, recursive trees and plane‐oriented recursive trees. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 493–508, 2017     

A Characterization of the Tutte Polynomial via Combinatorial Embeddings

We give a new characterization of the Tutte polynomial of graphs. Our characterization is formally close (but inequivalent) to the original definition given by Tutte as the generating function of spanning trees counted according to activities. Tutte’s notion of activity requires a choice of a linear order on the edge set (though the generating function of the activities is, in fact, independent of this order). We define a new notion of activity, the embedding-activity, which requires a choice of a combinatorial embedding of the graph, that is, a cyclic order of the edges around each vertex. We prove that the Tutte polynomial equals the generating function of spanning trees counted according to embedding-activities. This generating function is, in fact, independent of the embedding. Received March 15, 2006     

On the cover time of random walks on graphs

This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n ²) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271.     

先天性白内障一家系的致病基因研究

目的 对一个来自浙江省杭州地区的三代先天性白内障家系进行常染色体显性遗传基因的突变分析,以寻找其可能的致病基因及突变位点。方法 该家系共10例成员,其中包括4例患者。10 例家系成员在浙江省人民医院眼科中心接受眼科专科检查及全身检查,以排除存在白内障以外的眼部及全身疾患。10例家系成员各抽取外周血5ml,提取基因组DNA。针对国内外文献报道的与常染色体显性遗传先天性白内障相关的18 个基因（CRYAA、CRYAB、CRYBA1、CRYBA2、CRYBA4、CRYBB1、CRYBB2、CRYGC、CRYGD、CRYGS、GJA3、GJA8、MIP、BFSP、HSF4、PITX3、EPHA2、PAX6）设计引物,进行PCR 扩增,对扩产物进行测序和序列分析,了解这10例家系成员的以上基因是否存在相应的序列。结果 临床眼科检查显示该家系先天性白内障类型为粉尘状白内障。候选基因序列测定显示在CRYAA 第1 个外显子中第6 位碱基发生C→T 置换,氨基酸同为天门冬氨酸。该家系中所有患者均有此改变,而所有的正常家系成员均无此改变。结论 CRYAA 第1个外显子中第6位碱基发生C→T的同义突变可能是导致该家系先天性白内障发生的致病原因。     

五边形图的标准化的拉普拉斯谱及其应用

一个图的标准化的拉普拉斯特征值对图在结构性质和一些相关的动力学方面提供了信息,尤其在相关的随机过程方面. 在这篇文章中,我们给出了由一个简单连通图迭代生成的五边形图的标准化的拉普拉斯谱.在应用方面,我们得到了关于倍增度基尔霍夫指数,凯梅尼常数和生成树的个数的重要公式.     

Factorizations of complete graphs into caterpillars of diameter 5

We examine factorizations of complete graphs K_2n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K_2n.