An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

The problem of reconstructing the duplication tree of a set of tandemly repeated sequences which are supposed to have arisen by unequal recombination, was first introduced by Fitch (1977), and has recently received a lot of attention. In this paper, we place ourselves in a distance framework and deal with the restricted problem of reconstructing single copy duplication trees. We describe an exact and polynomial distance based algorithm for solving this problem, the parsimony version of which has previously been shown to be NP-hard (like most evolutionary tree reconstruction problems). This algorithm is based on the minimum evolution principle, and thus involves selecting the shortest tree as being the correct duplication tree. After presenting the underlying mathematical concepts behind the minimum evolution principle, and some of its benefits (such as statistical consistency), we provide a new recurrence formula to estimate the tree length using ordinary least-squares, given a matrix of pairwise distances between the copies. We then show how this formula naturally forms the dynamic programming framework on which our algorithm is based, and provide an implementation in O(n³) time and O(n²) space, where n is the number of copies.     

A comparison of rigid and flexible crosslinked polymer-supported peptide synthesis

To correlate the coupling difficulty and nature of the support in solid-phase peptide synthesis, a set of difficult peptides were built under identical conditions on rigid and hydrophobic divinyl benzene-crosslinked polystyrene (DVB-PS) and flexible and polar 1,4-butanediol dimethacrylate-crosslinked polystyrene (BDDMA-PS) resins of same functional capacity (∼2 mmol/g). The difficult coupling stages observed on each support were identified by monitoring the acylation time, coupling yield and deprotection efficiency. The yield and purity of the peptides prepared on BDDMA-PS were higher than when DVB-PS support was used.     

Graph family operations

In previous papers, Catlin introduced four functions, denoted , , , and , between sets of finite graphs. These functions proved to be very useful in establishing properties of several classes of graphs, including supereulerian graphs and graphs with nowhere zero k-flows for a fixed integer k3. Unfortunately, a subtle error caused several theorems previously published in Catlin (Discrete Math. 160 (1996) 67–80) to be incorrect. In this paper we correct those errors and further explore the relations between these functions, showing that there is a sort of duality between them and that they act as inverses of one another on certain sets of graphs.     

两两NQD列加权和的安全收敛性

本文研究两两NQD系加权和的完全收敛性，证明了一般双下标加权系数的加权部分和的完全收敛性，改进了吴群英（2002）的结果。     

On generalized Erd?s spaces

During the last years both Erd?s space and complete Erd?s space were topologically characterized by Dijkstra and van Mill. Applications include results about Erd?s type spaces in ?p-spaces as well as results about Polishable ideals on ω. We present an unifying theorem in terms of sets with a reflexive relation that among other things contains these apparently dissimilar results as special cases.     

完全椭圆积分和Hersch-Pfluger偏差函数

该文建立了Hersch-Pfluger偏差函数ψK(r)和第二类完全椭圆积分ε(r)之间的关系. 通过对完全椭圆积分及某些初等函数的组合的单调性和凹凸性的研究获得了完全椭圆积分的一些不等式, 并且藉此得到Hersch-Pfluger偏差函数ψK(r)的几个渐进精确的上界估计.     

On Appell sequences of polynomials of Bernoulli and Euler type

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number theoretical properties. A class of Euler-type polynomials is also presented.     

Incongruent restricted disjoint covering systems

We define an incongruent restricted disjoint covering system on [1,n] as a set of congruence classes such that each integer in the interval [1,n] belongs to exactly one class, and each class contains at least two members of the interval. In this paper we report some computational and structural results and present some open problems concerning such systems.     

完全区组设计下基于Aligned秩的有方向检验问题

本文基于Aligned秩给出了用于解完全区组设计有方向检验问题的, 我们称之为$C$-检验的检验方法. 本文分别对每个试验单元仅有一个观测值以及等重复观测值和不等重复观测值各种情形下的$C$检验进行了讨论, 并在原假设$H_0$成立时计算了上述各种情形下$C$检验统计量的数学期望和方差, 且证明了$C$检验统计量的渐近分布为正态分布.