In today's world, the science of bioinformatics is developing rapidly, especially with regard to the analysis and study of biological networks. Scientists have used various nature-inspired algorithms to find protein complexes in protein-protein interaction (PPI) networks. These networks help scientists guess the molecular function of unknown proteins and show how cells work regularly. It is very common in PPI networks for a protein to participate in multiple functions and belong to many complexes, and as a result, complexes may overlap in the PPI networks. However, developing an efficient and reliable method to address the problem of detecting overlapping protein complexes remains a challenge since it is considered a complex and har

      In this research, carbon nanotubes (CNTs) is prepared  through the Hummers method with a slight change in some of the work steps, thus, a new method has been created for preparing carbon nanotubes which is similar to the original Hummers method that is used to prepare graphene oxide. Then, the suspension carbon nanotubes is transferred to a simple electrode position platform consisting of two electrodes and the cell body for the coating and reduction of the carbon nanotubes on ITO glass which represents the cathode electrode while platinum represents the anode electrode. The deposited layer of carbon nanotubes is examined through the scanning electron microscope technique (SEM), and the images throughout the research show the

The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola

Background: Mineral Trioxide Aggregate (MTA) and BiodentineTM cements are new materials with numerous exciting clinical applications. Both have appreciable properties which include good physical properties and the ability to stimulate tissue regeneration as well as good antibacterial effects. The aim of this study was to investigate and compare the antibacterial effects of MTA and BiodentineTM, when they were mixed with different concentrations of aqueous solutions of Black Seed extract, against Enterococcus faecalis. Materials and methods: MTA and BiodentineTMwere prepared according to the manufacturer’s instructions. The method of Mawlood was followed to prepare the Black Seed aqueous solution. Agar diffusion method on Brain Heart

Background Bilateral cleft lip deformity is much more difficult to correct than unilateral cleft lip deformity. The complexity of the deformity and the sensitive relationships between the arrangement of the muscles and the characteristics of the external lip necessitate a comprehensive preoperative plan for management. The purpose of this study was to evaluate the repair of bilateral cleft lip using the Byrd modification of the traditional Millard and Manchester methods. A key component of this repair technique is focused on reconstruction of the central tubercle.

Methods Fourteen patients with mean age of 5.7 months presented with bilateral cleft lip deformity and were operated on using a mod

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res