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 perturb

generator the metal conductor is replaced by conducting gas plasma.

The Bouguer gravity and magnetic RTP data were used to detect the depth of basement rocks in middle and south Diyala Province, east Iraq. The depth of the basement rocks was calculated by using the Source Parameter Imaging (SPI) method. New attempt is achieved to applied the SPI technique to the gravity values to estimate the depth of basement rocks. The depths of basement map derived from gravity data range 8-14 km, the depth of basement map derived from magnetic data range 9-13.5 km and the basement depth prepared by C.G.G, 1974 range 9-11 km. The derived maps from SPI method and that prepared by C.G.G, 1974 show good matching in the distribution of the depths of the study area. This study showed that basement’s depth range from

In this paper We introduce some new types of almost bi-periodic points in topological bitransfprmation groups and thier effects on some types of minimaliy in topological dynamics

 In this paper, we introduce and study the concept of a new class of generalized closed set which is called generalized b*-closed set in topological spaces ( briefly .g b*-closed) we study also. some of its  basic properties and investigate the relations between the associated topology. 

    The aim of our work is to develop a new type of games which are related to (D, WD, LD) compactness of topological groups. We used an infinite game that corresponds to our work. Also, we used an alternating game in which the response of the second player depends on the choice of the first one. Many results of winning and losing strategies have been studied, consistent with the nature of the topological groups. As well as, we presented some topological groups, which fail to have winning strategies and we give some illustrated examples. Finally, the effect of functions on the aforementioned compactness strategies was studied.  

     This paper introduces cutpoints and separations in -connected topological spaces, which are constructed by using the union of vertices set and edges set for a connected graph, and studies the relationships between them. Furthermore, it generalizes some new concepts.