One of the recent significant but challenging research studies in computational biology and bioinformatics is to unveil protein complexes from protein-protein interaction networks (PPINs). However, the development of a reliable algorithm to detect more complexes with high quality is still ongoing in many studies. The main contribution of this paper is to improve the effectiveness of the well-known modularity density ( ) model when used as a single objective optimization function in the framework of the canonical evolutionary algorithm (EA). To this end, the design of the EA is modified with a gene ontology-based mutation operator, where the aim is to make a positive collaboration between the modularity density model and the proposed

Survival analysis is widely applied in data describing for the life time of item until the occurrence of an event of interest such as death or another event of understudy . The purpose of this paper is to use the dynamic approach in the deep learning neural network method, where in this method a dynamic neural network that suits the nature of discrete survival data and time varying effect. This neural network is based on the Levenberg-Marquardt (L-M) algorithm in training, and the method is called Proposed Dynamic Artificial Neural Network (PDANN). Then a comparison was made with another method that depends entirely on the Bayes methodology is called Maximum A Posterior (MAP) method. This method was carried out using numerical algorithms re

In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

The results showed the spread of disease blight leaves caused by injury fungus Alternaria in different areas of cultivation in the city of Baghdad where he was recording the highest rate and the severity of the disease of 100% and 80%, respectively, in the Abu Ghraib area and the least of 20% and 12% respectively in the Amiriya district results showed test pathogenicity of the fungus pathogen emergence of symptoms of the disease superficial discoloration Authority of black paper when wound areas and yellowing of leaves about race as centrist and leaky latest country clear ????? on Central race after 48 hours ....

The study was conducted during the spring season of 2000 and2001. The objective was to study the changes in leaves number of sunflower plants and its leaf area during growth stages under hardening conditions to drought tolerance. Agricultural practices were made according to recommendations.Asplit-split plots design was used with three replications.The main plots included irrigation treatments:irrigation to100%(full irrigation),75and50%of available water.The sub plots were the cultivars Euroflor and Flame.The sub-sub plots represented four seed soaking treatments:Control(unsoaking), soaking in water ,Paclobutrazol solution(250ppm),and Pix solution(500ppm). The soaking continued for 24 hours then seeds were dried at room temperature

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed