mRNA序列与蛋白序列对比

生物序列的对比是计算生物学中的一个基本问题．目前已有许多算法对DNA序列或蛋白序列之间进行对比,多是对同种生物序列进行对比．为得到mRNA序列和蛋白序列之间的对比,采用动态规划算法,提供了寻求mRNA序列和蛋白序列的局部对比和全局对比,解决了核酸与氨基酸之间的对比问题．算法的时间复杂度为O(nm)．     

On convergence for trigonometric interpolation of analytic function

In this paper, we give a necessary and sufficient condition of sequence of nodes, such that, the error of trigonometric interpolation for analytic function converges to 0. Foundation item: Supported by the Science Foundation of SEC of China and Foundation of Wuhan University Biography: LIU Hua (1971-), male, PH. D candidate, Research interest is in complex analysis.     

Phylogeny constructed by using diversity increment

A new approach based on the concept of the diversity increment is applied to reconstruct a phylogeny. The phylogeny of the Eutherian orders use concatenated H-stranded amino acid sequences, and the result is consistent with the commonly accepted one for the Eutherians. Foundation item: Supported by the National Natural Science Foundation of China ( 30170214) and the Open Foundation of the State Key Laboratory of Software Engineer, Wuhan University, China. Biography: Shi Feng ( 1966- ), male, Ph. D, Associate professor, research direction: bioinformatics.     

Some special properties of singular integral operators

In this paper, we have proved some special properties of singular integral operators which are transformed from the singular integral equation defined in the interval (−1, 1), i.e., the properties of singular intergral operators at the endpoints and in the inner of (−1, 1). Foundation item: Supported by the Science Foundation of SEC of China and Foundation of Wuhan University. Biography: GONG Ya-fang (1973-), male, Ph. D candidate. Current research interest is in numerical solution of singular integral equation.     

The numerical method of inversion for the interior Radon transform

The interior Radon transform arises from a limited data problem in computerized tomography. The corresponding operator R is investigated as a mapping between wightedL ₂-spaces. Our result is the explicit construction of a singular value decomposition for R. This immediately leads to an inversion formula by series expansion and range characterizations. Foundation item: Supported by the Foundation of the Ministry of Education of China and the Science Foundation of Wuhan University Biography: WANG Jin-ping (1963-), male, Ph.D candidate, Research interests are in numerical solution of singular integral equation and integral transformation.     

Some massively parallel algorithms from nature

We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering, Wuhan University. Results on parallel solvers include the following areas: Evolutionary algorithms based on imitating the evolution processes of nature for parallel problem solving, especially for parallel optimization and model-building; Asynchronous parallel algorithms based on domain decomposition which are inspired by physical analogies such as elastic relaxation process and annealing process, for scientific computations, especially for solving nonlinear mathematical physics problems. All these algorithms have the following common characteristics: inherent parallelism, self-adaptation and self-organization, because the basic ideas of these solvers are from imitating the natural evolutionary processes. Foundation item: Supported by the National Natural Science Foundation of China (No. 60133010, No. 70071042, No. 60073043) and National Laboratory for Parallel and Distributed Processing Biography: Li Yan (1974-), female, Ph. D candidate, research direction: evolutionary computation.     

Binary Sequences from a Pair of Elliptic Curves

A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess ＂good＂ cryptographie properties of 0-1 distribution, long period and large linear complexity. The results indicate that such se quences provide strong potential applications in cryptography.     

A feedback-based web search engine

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected hy them. Since the selections of the search results cannot affect the future ones. they may not cover most people‘s interests. In this paper, feedback informarion produced by the users‘ accessing lists will be represented By the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability.     

Distance-measuring technology using LD for auto anti-collision

Auto anti-collision technology is one of the main research subjects of automobiles‘ safety technology. Aiming at the key technology of Auto anti-collision, measuring the distance from obstacles, based on the theory of phase laser distance ranging, Laser Diode (LD) distance-measuring system for auto anti-collision has been developed to solve the problem of on-line measuring distance technology in middle to long distance utilizing the good characteristics of LD when modulating its optical intensity and adopting typical kinds of filter techniques in this paper. By theoretical analysis, adopting typical kinds of filter techniques can reduce the interference of strong light, so distance-measuring range can be 0. 5-100 m in daytime or 1-200 m at night. And more, from theoretical analysis and experiment result, it can guarantee the high measuring resolution which can be less than 24. 5 mmutilizing the method of two Laser Diode optical intensity modulating wavelength and complimenting precise calibration and revision. The idea of LD distance-measuring technology is novel and feasible and this technology can be applied in Auto anti-collision.     

A modified non-homogeneous model for codon preference and primary sequence structure in protein-coding regions

Based on non-homogeneous model, a modified model is proposed. The new model deals with codon preference in protein-coding regions, reflects more accurately the key biological features of the regions. In addition, it is demonstrated, via an example, the modified model offers better solutions than previous model does. Foundation item: Supported by the Zi-qiang Science Foundation of Wuhan University Biography: Han Le (1977-), female, Master candidate, research direction: optimization and bioinformatics     

Physical location of terminal markers belonging to five linkage groups in maize RFLP map using in situ hybridization

Ten terminal or subterminal RFLP markers belonging to linkage groups 1, 3, 5, 6, and 10 in maize RFLP map were physically locted onto maize mitotic chromosomes with in situ hybridization. All biotinylated probes from 600 to 2 250 bp were detected by DAB staining. The markers belonging to linkage groups 1, 3, 5, 6, and 10 correspondingly located at the chromosomes 1, 3, 5, 6, and 10. All of the tested markers except bnl6.25 and umc44 were duplicated sequences. Each of them was also labeled on another chromosome besides on the chromosome corresponding to its linkage group. The marker bnl3. 04 was triplicated sequences and the signals were detected on three nonhomologous chromosomes. In the tested ten markers, there were only four located at the ends of corresponding chromosomes. Others were located at sites midway along the chromosome arms or near the centromeres. The region covered by two terminal or subterminal markers in each of linkage groups 1, 3, 5, and 6 occupied 80.02%, 38.25%, 82.30% and 51.16% of the region of both short and long arms in chromosomes 1, 3, 5, and 6 respectively. Only two terminal markers of linkage group 10 covered the whole chromosome 10. In some linkage groups, two terminal or subterminal markers covered a short genetic distance but were physically distant, while two covering a longer genetic distance were physically closer. Supported by The National Natural Science Foundation of China and the Doctorate Vesting Point Foundation of the Education Committec of the People's Republic of China Mao Ninghui: born in 1986, used to be an MS student of Wuhan University in 1992–1995 and now is working in Fudan University, Shanghai 200433     

基于遗传算法的序列比对方法

为有效解决大尺度基因组序列的比对分析,提出了一种基于遗传算法的序列比对方法。该算法通过对序列比对问题进行编码,将其转换成了搜索空间中的一个优化问题。实验结果表明,这种新的比对算法是有效的,它在占用少量内存的情况下可以获得近似于Need lem an-W unsch算法结果的最优解。     

复杂轮廓激光切割路径优化算法的研究

激光切割的加工路径优化问题实质上是如何缩短激光头在轮廓间移动的空行程距离.复杂轮廓的切割顺序的生成必须考虑轮廓的嵌套问题.本文以轮廓位置关系为约束条件,根据图论原理将加工路径优化问题归结为广义旅行商问题(GTSP).提出了先按照轮廓位置关系构造树形结构,然后以加工起点为基准点按照从内向外的顺序遍历树形结构的优化算法,并给出应用实例.实验统计表明,使用该算法可将激光头空行程距离减少10%以上,明显的提高了激光切割的效率和质量.     

A Disk Scheduling Algorithm： SPFF

We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically.Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first （SPFF）. This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head moving distance, it has the stronger glohality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system＇s different demands.     

A DNA sequence alignment algorithm using quality information and a fuzzy inference method

DNA sequence alignment algorithms in computational molecular biology have been improved by diverse methods. In this paper, we propose a DNA sequence alignment that uses quality information and a fuzzy inference method developed based on characteristics of DNA fragments and a fuzzy logic system in order to improve conventional DNA sequence alignment methods that uses DNA sequence quality information. In conventional algorithms, DNA sequence alignment scores are calculated by the global sequence alignment algorithm proposed by Needleman-Wunsch, which is established by using quality information of each DNA fragment. However, there may be errors in the process of calculating DNA sequence alignment scores when the quality of DNA fragment tips is low, because only overall DNA sequence quality information are used. In our proposed method, an exact DNA sequence alignment can be achieved in spite of low quality of DNA fragment tips by improvement of conventional algorithms using quality information. Mapping score parameters used to calculate DNA sequence alignment scores are dynamically adjusted by the fuzzy logic system utilizing lengths of DNA fragments and frequencies of low quality DNA bases in the fragments. From the experiments by applying real genome data of National Center for Biotechnology Information, we could see that the proposed method is more efficient than conventional algorithms.     

Cell evolutionary algorithm: a new optimization method on ground-state energy of the atomic

The purpose of this paper is to present a new general approach to solve ground-state energies of the double-electron systems in a uniform magnetic field, in which the basic element of evolution is the set in the solution space, rather than the point. The paper defines the Cell Evolutionary Algorithm, which implements such a view of the evolution mechanism. First, the optimal set in which the optimal solution may be obtained. Then this approach applies the embedded search method to get the optimal solution. We tested this approach on the atomic structure, and the results show that it can improve not only the efficiency but also the accuracy of the calculations as it relates to this specific problem. Foundation item: Supported by the opening Foundation of state key Laboratory of Magnetic Resonance and Atomic and Molecular physics, Wuhan Institute of physics, Chinese Academy of Science (981510) Biography: Liu Lian-jun(1946-), female, Associate professor, research direction: atom and molecular physics.     

A DNA sequence alignment algorithm using quality information and a fuzzy inference method

DNA sequence alignment algorithms in computational molecular biology have been improved by diverse methods. In this paper, we propose a DNA sequence alignment that uses quality information and a fuzzy inference method developed based on the characteristics of DNA fragments and a fuzzy logic system in order to improve conventional DNA sequence alignment methods that uses DNA sequence quality information. In conventional algorithms, DNA sequence alignment scores are calculated by the global sequence alignment algo- rithm proposed by Needleman-Wunsch, which is established by using quality information of each DNA fragment. However, there may be errors in the process of calculating DNA sequence alignment scores when the quality of DNA fragment tips is low, because only the overall DNA sequence quality information are used. In our proposed method, an exact DNA sequence alignment can be achieved in spite of the low quality of DNA fragment tips by improvement of conventional algorithms using quality information. Mapping score param- eters used to calculate DNA sequence alignment scores are dynamically adjusted by the fuzzy logic system utilizing lengths of DNA fragments and frequencies of low quality DNA bases in the fragments. From the experiments by applying real genome data of National Center for Biotechnology Information, we could see that the proposed method is more efficient than conventional algorithms.     

Spectrofluorimetric determination of magnesium (II) with 7-(8-Hydroxy-3, 6-disulfonaphthylazo)-8-hydroxyquinoline-5-sulfonic acid

A new fluorescent reagent, 7-(8-hydroxy-3, 6-disulfonaphthylazo)-8-hydroxyquinoline-5-sulfonic acid (HDNHQ) for the determination of magnesium has been developed. It reacted with magnesium to form a 1∶1 fluorescent complex withλ _ex/λ _em immediately at room temperature in ammonia-ammonium chloride buffer (pH 10.7). A linear relationship was obtained in the magnesium concentration range of 0–160 ng·mL⁻¹ with the detection limit of 0.04 ng·mL⁻¹. The proposed method was simple, rapid and sensitive. It has been successfully applied to the determination of trace magnesium in blood serum with recoveries of 103.75% and 98.16%, respectively. Foundation item: Supported by the Zi-Qiang Foundation of Wuhan University Biography: Zhang Xian (1975-), female, Ph. D candidant, research direction: organic reagent synthesis and analysis.     

An efficient simulation tool of performance evaluation for communication networks

We provide an efficient simulation tool for performance evaluation in communication networks. Not only the general simulation functions—which can be found in some old simulation tools, but also the perturbation function module via the Standard Clock (SC) approach—in which more than 2 perturbation simulation event paths can be constructed parallelly based on a single nominal simulation event path is included in this simulation software platform. Supported by the National Natural Science Foundation of China Wang Xinmiao: born in Nov, 1973, Graduate student