By definition, the detection of protein complexes that form protein-protein interaction networks (PPINs) is an NP-hard problem. Evolutionary algorithms (EAs), as global search methods, are proven in the literature to be more successful than greedy methods in detecting protein complexes. However, the design of most of these EA-based approaches relies on the topological information of the proteins in the PPIN. Biological information, as a key resource for molecular profiles, on the other hand, acquired a little interest in the design of the components in these EA-based methods. The main aim of this paper is to redesign two operators in the EA based on the functional domain rather than the graph topological domain. The perturbation mechanism of both crossover and mutation operators is designed based on the direct gene ontology annotations and Jaccard similarity coefficients for the proteins. The results on yeast Saccharomyces cerevisiae PPIN provide a useful perspective that the functional domain of the proteins, as compared with the topological domain, is more consistent with the true information reported in the Munich Information Center for Protein Sequence (MIPS) catalog. The evaluation at both complex and protein levels reveals that feeding the components of the EA with biological information will imply more accurate complex structures, whereas topological information may mislead the algorithm towards a faulty structure.
Abstract:
One of the most prominent historical stage feature that is well- known
nowadays in the world is democracy issue. This issue gives man the right to
reflect his concept and notions . It,s the world of freedom , human right and
liberation of women. This leads to the principle of equality between women
and men which is put in the top of liberty and Improvement lists .
Improvement can be defined as a group of means and ways that is
used to direct human work to improve their level of life economically and
socially .
This study contains three sections, the first presents the social state of
women in pre-history period . And the second section presents the theory of
improvement as an important social ph
In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot. Simulation results, whi
... Show MoreSoftware Defined Network (SDN) is a new technology that separate the control plane from the data plane. SDN provides a choice in automation and programmability faster than traditional network. It supports the Quality of Service (QoS) for video surveillance application. One of most significant issues in video surveillance is how to find the best path for routing the packets between the source (IP cameras) and destination (monitoring center). The video surveillance system requires fast transmission and reliable delivery and high QoS. To improve the QoS and to achieve the optimal path, the SDN architecture is used in this paper. In addition, different routing algorithms are used with different steps. First, we eva
... Show MoreThe parameter and system reliability in stress-strength model are estimated in this paper when the system contains several parallel components that have strengths subjects to common stress in case when the stress and strengths follow Generalized Inverse Rayleigh distribution by using different Bayesian estimation methods. Monte Carlo simulation introduced to compare among the proposal methods based on the Mean squared Error criteria.
The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic
... Show Moreالصيغة العامة للمعقدات الجديدة [M2(BDS)Cl4] الناتجة من تفاعل الليكاند الجديد] ن1,ن4-ثنائي(1أ –بنزو]د[ اميدازول-2-يل)-ن1,ن4-ثنائي(4-ثنائي مثيل امينو) بنزيل) سكسنمايد[ (BDS) مع الايونات الفلزية الكادميوم, الكوبلت, الزئبق, النحاس والنيكل. تم اشتقاق هذا الليكاند من تفاعل المواد الثلاث 4-(ثنائي ميثيل أمينو) بنزالدهيد، 2-أمينو بنزيميدازول، وكلوريد السكسينيل. تم تشخيص المركبات باستخدام مطيافية طيف الاشعة تحت الحمراء وطيف الرن
... Show MoreSensibly highlighting the hidden structures of many real-world networks has attracted growing interest and triggered a vast array of techniques on what is called nowadays community detection (CD) problem. Non-deterministic metaheuristics are proved to competitively transcending the limits of the counterpart deterministic heuristics in solving community detection problem. Despite the increasing interest, most of the existing metaheuristic based community detection (MCD) algorithms reflect one traditional language. Generally, they tend to explicitly project some features of real communities into different definitions of single or multi-objective optimization functions. The design of other operators, however, remains canonical lacking any inte
... Show More