超级多重基因组序列比对算法

大量同源的长基因组序列的多重比对需要高效率的比对算法。论文开发出一个新的比对工具“超级多重基因组比对”(简称SMGA),该系统是建立在序列突变与比对的“模代数”理论基础上专为长基因组序列的多重比对设计的。SMGA在一台主频2.8G的PC机上完成平均长度约5M的9条有机菌基因组的多重比对的时间大约为35min。论文还使用模拟数据对SMGA的比对精确度做了估计。

On the Model Properties of BCK Algebras

This paper is devoted to the study of the logical properties of BCK algebras. For formalized BCK algebra theory T, it is proved that T is preserved under submodels and unions of chains; T is neither complete nor model complete, and hence there exist no built-in Skolem function. Moreover, the ultraproduct BCK algebras and the fuzzy ultraproduct of fuzzy subsets of BCK algebras were proposed by using the concept of ultrafilters with corresponding properties of fuzzy ideals discussed.

Agents and Lattice-valued Logic

In fuzzy set theory, instead of the underlying membership set being a two-valued set it is a multi-valued set that generally has the structure of a lattice L with a minimal element O and the maximal element I. Furthermore if ∧, ∨, → and ┐ are defined in the set L, then we can use these operations to define, as in the ordinary set theory, operations on fuzzy subsets. In this paper we give a model of the Lattice-Valued Logic with set of agents. Any agents know the logic value of a sentence p. The logic value is compatible with all of the accessible conceptual models or worlds of p inside the agent. Agent can be rational or irrational in the use of the logic operation. Every agent of n agents can have the same set of conceptual models for p and know the same logic for p in this case the agents form a consistent group of agents. When agents have different conceptual models for p, different subgroup of agents know different logic value for p. In this case the n agents are inconsistent in the expression of the logic value for p. The valuation structure of set of agents can be used as a semantic model for the Lattice-valued Logic and fuzzy logic.

Crossed products for Hopf group-algebras

First,the group crossed product over the Hopf group-algebras is defined,and the necessary and sufficient conditions for the group crossed product to be a group algebra are given.The cleft extension theory of the Hopf group algebra is introduced,and it is proved that the crossed product of the Hopf group algebra is equivalent to the cleft extension.The necessary and sufficient conditions for the crossed product equivalence of two Hopf groups are then given.Finally,combined with the equivalence theory of the Hopf group crossed product and cleft extension,the group crossed product constructed by the general 2-cocycle as algebra is determined to be isomorphic to the group crossed product of the 2-cocycle with a convolutional invertible map of the 2-cocycle.The unit property of a general 2-cocycle is equivalent to the convolutional invertible map of the 2-cocycle,and the combination condition of the weak action is equivalent to the convolutional invertible map of the 2-cocycle and the combination condition of the weak action.Similarly,crossed product algebra constructed by the general 2-cocycle is isomorphic to the Hopfπ-crossed product algebra constructed by the 2-cocycle with a convolutional invertible map.

Quotient space model based on algebraic structure

In the quotient space theory of granular computing,the universe structure is assumed to be a topology,therefore,its application is still limited.In this study,based on the quotient space model,the universe structure is assumed as an algebra instead of a topology.As to obtain the algebraic quotient operator,the granulation must be uniquely determined by a congruence relation,and all the congruence relations form a complete semi-order lattice,which is the theoretical basis of granularities ' completeness.When the given equivalence relation is not a congruence relation,it defines the concepts of upper quotient and lower quotient,and discusses some of their properties which demonstrate that falsity preserving principle and truth preserving principle are still valid.Finally,it presents the algorithms and example of upper quotient and lower quotient.The work extends the quotient space theory from structure,and provides theoretical basis for the combination of the quotient space theory and the algebra theory.

Transitional Description of Diatomic Molecules in U（4） Vibron Model

U(3)-O(4) transitional description of diatomic molecules in the U(4) vibron model is studied by usingthe algebraic Bethe ansatz, in which the O(4) limit is a special case of the theory. Vibrational band-heads of sometypical diatomic molecules are fitted by both transitional theory and the O(4) limit within the same framework. Theresults show that there are evident deviations from the O(4) limit in description of vibrational spectra of some diatomicmolecules.

The rough representation and measurement of quotient structure in algebraic quotient space model

Granular computing is a very hot research field in recent years. In our previous work an algebraic quotient space model was proposed,where the quotient structure could not be deduced if the granulation was based on an equivalence relation. In this paper,definitions were given and formulas of the lower quotient congruence and upper quotient congruence were calculated to roughly represent the quotient structure. Then the accuracy and roughness were defined to measure the quotient structure in quantification. Finally,a numerical example was given to demonstrate that the rough representation and measuring methods are efficient and applicable. The work has greatly enriched the algebraic quotient space model and granular computing theory.