Morphometric and phylogenetic analysis of theDaviesia ulicifolia complex (Fabaceae, Mirbelieae)

Daviesia ulicifolia is a widespread species that exhibits complex variation throughout its range. Using ordination and cluster analysis of morphometric characters we resolved ten terminal taxa for phylogenetic analysis. A data set including these and five closely related species was coded for a combination of morphometric and qualitative characters and analysed using parsimony. This revealed thatD. ulicifolia is paraphyletic by inclusion ofD. acicularis, D. arenaria andD. microcarpa. One terminal cluster is more similar to an outgroup species (D. arthropoda) than toD. ulicifolia and should be treated as a new species. Given recent theoretical and empirical studies showing paraphyly to be both expected and observed at species level, we propose that all existing species in this group continue to be recognised taxonomically. We suggest subdividingD. ulicifolia into several subspecies.     

Cloning, sequencing and heterologous expression of a new chitinase gene, chi92, from Streptomyces olivaceoviridis ATCC 11238

A new chitinase gene, chi92, encoding the largest known chitinase from Streptomyces olivaceoviridisATCC 11238 was sequenced by means of different PCR-methods. The cloned gene was expressed in E. coliand the recombinant protein could be detected by Western-blot analysis. The multiplicity of chitinolytic enzymes of this strain is discussed.     

What you feel is what you see: inverse dynamics estimation underlies the resistive sensation of a delayed cursor

How our central nervous system (CNS) learns and exploits relationships between force and motion is a fundamental issue in computational neuroscience. While several lines of evidence have suggested that the CNS predicts motion states and signals from motor commands for control and perception (forward dynamics), it remains controversial whether it also performs the ‘inverse’ computation, i.e. the estimation of force from motion (inverse dynamics). Here, we show that the resistive sensation we experience while moving a delayed cursor, perceived purely from the change in visual motion, provides evidence of the inverse computation. To clearly specify the computational process underlying the sensation, we systematically varied the visual feedback and examined its effect on the strength of the sensation. In contrast to the prevailing theory that sensory prediction errors modulate our perception, the sensation did not correlate with errors in cursor motion due to the delay. Instead, it correlated with the amount of exposure to the forward acceleration of the cursor. This indicates that the delayed cursor is interpreted as a mechanical load, and the sensation represents its visually implied reaction force. Namely, the CNS automatically computes inverse dynamics, using visually detected motions, to monitor the dynamic forces involved in our actions.     

A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem

We present a P system with replicated rewriting to solve the Maximum Clique Problem for a graph. Strings representing cliques are built gradually. This involves the use of inhibitors that control the space of all generated solutions to the problem. Calculating the maximum clique for a graph is a highly relevant issue not only on purely computational grounds, but also because of its relationship to fundamental problems in genomics. We propose to implement the designed P system by means of a DNA algorithm. This algorithm is then compared with two standard papers that addressed the same problem and its DNA implementation in the past. This comparison is carried out on the basis of a series of computational and physical parameters. Our solution features a significantly lower cost in terms of time, the number and size of strands, as well as the simplicity of the biological implementation.     

魔芋接枝丙烯酸高吸水性树脂的制备及性能研究

本实验以魔芋精粉为基体,环己烷为连续相,Span-60为分散剂,硝酸铈铵为引发剂、用反相悬浮聚合法合成魔芋-丙烯酸高吸水性树脂。研究了多种因素对接枝共聚物吸水性能的影响。结果表明:反应时间为2 h、魔芋精粉与丙烯酸质量比为1∶5、交联剂用量为物料质量的0.04%、引发剂为3×10-3mol/L、丙烯酸中和度为60%、反应温度为70℃时,接枝共聚物吸水性能最优。并通过对接枝产物的红外图谱分析,证实了反应的可行性。     

Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems

A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki＇s neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.     

基于质粒DNA匹配问题的分子算法

给定无向图,图的最小极大匹配问题是寻找每条边都不相邻的最大集中的最小者,这个问题是著名的NP-完全问题.1994年Adleman博士首次提出用DNA计算解决NP-完全问题,以编码的DNA序列为运算对象,通过分子生物学的运算操作解决复杂的数学难题,使得NP-完全问题的求解可能得到解决.提出了基于质粒DNA的无向图的最大匹配问题的DNA分子生物算法,通过限制性内切酶的酶切和凝胶电泳完成解的产生和最终接的分离,依据分子生物学的实验手段,算法是有效并且可行的.     

An efficient algorithm for DNA fragment assembly in MapReduce

Fragment assembly is one of the most important problems of sequence assembly. Algorithms for DNA fragment assembly using de Bruijn graph have been widely used. These algorithms require a large amount of memory and running time to build the de Bruijn graph. Another drawback of the conventional de Bruijn approach is the loss of information. To overcome these shortcomings, this paper proposes a parallel strategy to construct de Bruijin graph. Its main characteristic is to avoid the division of de Bruijin graph. A novel fragment assembly algorithm based on our parallel strategy is implemented in the MapReduce framework. The experimental results show that the parallel strategy can effectively improve the computational efficiency and remove the memory limitations of the assembly algorithm based on Euler superpath. This paper provides a useful attempt to the assembly of large-scale genome sequence using Cloud Computing.